git/alloc.c at master · UndefinedBehaviour/git · GitHub

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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}
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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
/*
 * alloc.c - specialized allocator for internal objects
 *
 * Copyright (C) 2006 Linus Torvalds
 *
 * The standard malloc/free wastes too much space for objects, partly because
 * it maintains all the allocation infrastructure (which isn't needed, since
 * we never free an object descriptor anyway), but even more because it ends
 * up with maximal alignment because it doesn't know what the object alignment
 * for the new allocation is.
 */
#include"cache.h"
#include"object.h"
#include"blob.h"
#include"tree.h"
#include"commit.h"
#include"tag.h"

#defineBLOCKING 1024

unionany_object {
structobjectobject;
structblobblob;
structtreetree;
structcommitcommit;
structtagtag;
};

structalloc_state {
intcount; /* total number of nodes allocated */
intnr; /* number of nodes left in current allocation */
void*p; /* first free node in current allocation */
};

staticinlinevoid*alloc_node(structalloc_state*s, size_tnode_size)
{
void*ret;

if (!s->nr) {
s->nr=BLOCKING;
s->p=xmalloc(BLOCKING*node_size);
	}
s->nr--;
s->count++;
ret=s->p;
s->p= (char*)s->p+node_size;
memset(ret, 0, node_size);
returnret;
}

staticstructalloc_stateblob_state;
void*alloc_blob_node(void)
{
structblob*b=alloc_node(&blob_state, sizeof(structblob));
b->object.type=OBJ_BLOB;
returnb;
}

staticstructalloc_statetree_state;
void*alloc_tree_node(void)
{
structtree*t=alloc_node(&tree_state, sizeof(structtree));
t->object.type=OBJ_TREE;
returnt;
}

staticstructalloc_statetag_state;
void*alloc_tag_node(void)
{
structtag*t=alloc_node(&tag_state, sizeof(structtag));
t->object.type=OBJ_TAG;
returnt;
}

staticstructalloc_stateobject_state;
void*alloc_object_node(void)
{
structobject*obj=alloc_node(&object_state, sizeof(unionany_object));
obj->type=OBJ_NONE;
returnobj;
}

staticstructalloc_statecommit_state;

unsigned intalloc_commit_index(void)
{
staticunsigned intcount;
returncount++;
}

void*alloc_commit_node(void)
{
structcommit*c=alloc_node(&commit_state, sizeof(structcommit));
c->object.type=OBJ_COMMIT;
c->index=alloc_commit_index();
returnc;
}

staticvoidreport(constchar*name, unsigned intcount, size_tsize)
{
fprintf(stderr, "%10s: %8u (%"PRIuMAX" kB)\n",
name, count, (uintmax_t) size);
}

#defineREPORT(name, type)	\
 report(#name, name##_state.count, name##_state.count * sizeof(type) >> 10)

voidalloc_report(void)
{
REPORT(blob, structblob);
REPORT(tree, structtree);
REPORT(commit, structcommit);
REPORT(tag, structtag);
REPORT(object, unionany_object);
}