summaryrefslogtreecommitdiff
path: root/cache.h
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@linux-foundation.org>2007-04-16 22:10:19 -0700
committerJunio C Hamano <junkio@cox.net>2007-04-16 23:36:11 -0700
commit2c1cbec1e2f0bd7b15fe5e921d287babfd91c7d3 (patch)
treeee149f21b7fe1a53ced6a4051e10268608d14d54 /cache.h
parentf948792990f82a35bf0c98510e7511ef8acb9cd3 (diff)
downloadgit-2c1cbec1e2f0bd7b15fe5e921d287babfd91c7d3.tar.gz
Use proper object allocators for unknown object nodes too
We used to use a different allocator scheme for when we didn't know the object type. That meant that objects that were created without any up-front knowledge of the type would not go through the same allocation paths as normal object allocations, and would miss out on the statistics. But perhaps more importantly than the statistics (that are useful when looking at memory usage but not much else), if we want to make the object hash tables use a denser object pointer representation, we need to make sure that they all go through the same blocking allocator. Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org> Signed-off-by: Junio C Hamano <junkio@cox.net>
Diffstat (limited to 'cache.h')
-rw-r--r--cache.h1
1 files changed, 1 insertions, 0 deletions
diff --git a/cache.h b/cache.h
index b1bd9e46c2..aa72791947 100644
--- a/cache.h
+++ b/cache.h
@@ -484,6 +484,7 @@ extern struct blob *alloc_blob_node(void);
extern struct tree *alloc_tree_node(void);
extern struct commit *alloc_commit_node(void);
extern struct tag *alloc_tag_node(void);
+extern struct object *alloc_object_node(void);
extern void alloc_report(void);
/* trace.c */