2005-04-18 18:39:48 +00:00
|
|
|
#ifndef OBJECT_H
|
|
|
|
|
#define OBJECT_H
|
|
|
|
|
|
|
|
|
|
struct object_list {
|
|
|
|
|
struct object *item;
|
|
|
|
|
struct object_list *next;
|
|
|
|
|
};
|
|
|
|
|
|
2005-11-17 05:32:44 +00:00
|
|
|
struct object_refs {
|
|
|
|
|
unsigned count;
|
2006-06-18 18:45:02 +00:00
|
|
|
struct object *base;
|
2006-01-07 09:33:54 +00:00
|
|
|
struct object *ref[FLEX_ARRAY]; /* more */
|
2005-11-17 05:32:44 +00:00
|
|
|
};
|
|
|
|
|
|
Add "named object array" concept
We've had this notion of a "object_list" for a long time, which eventually
grew a "name" member because some users (notably git-rev-list) wanted to
name each object as it is generated.
That object_list is great for some things, but it isn't all that wonderful
for others, and the "name" member is generally not used by everybody.
This patch splits the users of the object_list array up into two: the
traditional list users, who want the list-like format, and who don't
actually use or want the name. And another class of users that really used
the list as an extensible array, and generally wanted to name the objects.
The patch is fairly straightforward, but it's also biggish. Most of it
really just cleans things up: switching the revision parsing and listing
over to the array makes things like the builtin-diff usage much simpler
(we now see exactly how many members the array has, and we don't get the
objects reversed from the order they were on the command line).
One of the main reasons for doing this at all is that the malloc overhead
of the simple object list was actually pretty high, and the array is just
a lot denser. So this patch brings down memory usage by git-rev-list by
just under 3% (on top of all the other memory use optimizations) on the
mozilla archive.
It does add more lines than it removes, and more importantly, it adds a
whole new infrastructure for maintaining lists of objects, but on the
other hand, the new dynamic array code is pretty obvious. The change to
builtin-diff-tree.c shows a fairly good example of why an array interface
is sometimes more natural, and just much simpler for everybody.
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-06-20 00:42:35 +00:00
|
|
|
struct object_array {
|
|
|
|
|
unsigned int nr;
|
|
|
|
|
unsigned int alloc;
|
|
|
|
|
struct object_array_entry {
|
|
|
|
|
struct object *item;
|
|
|
|
|
const char *name;
|
|
|
|
|
} *objects;
|
|
|
|
|
};
|
|
|
|
|
|
Shrink "struct object" a bit
This shrinks "struct object" by a small amount, by getting rid of the
"struct type *" pointer and replacing it with a 3-bit bitfield instead.
In addition, we merge the bitfields and the "flags" field, which
incidentally should also remove a useless 4-byte padding from the object
when in 64-bit mode.
Now, our "struct object" is still too damn large, but it's now less
obviously bloated, and of the remaining fields, only the "util" (which is
not used by most things) is clearly something that should be eventually
discarded.
This shrinks the "git-rev-list --all" memory use by about 2.5% on the
kernel archive (and, perhaps more importantly, on the larger mozilla
archive). That may not sound like much, but I suspect it's more on a
64-bit platform.
There are other remaining inefficiencies (the parent lists, for example,
probably have horrible malloc overhead), but this was pretty obvious.
Most of the patch is just changing the comparison of the "type" pointer
from one of the constant string pointers to the appropriate new TYPE_xxx
small integer constant.
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-06-14 23:45:13 +00:00
|
|
|
#define TYPE_BITS 3
|
|
|
|
|
#define FLAG_BITS 27
|
|
|
|
|
|
2006-07-12 03:45:31 +00:00
|
|
|
/*
|
|
|
|
|
* The object type is stored in 3 bits.
|
|
|
|
|
*/
|
2005-04-18 18:39:48 +00:00
|
|
|
struct object {
|
|
|
|
|
unsigned parsed : 1;
|
|
|
|
|
unsigned used : 1;
|
Shrink "struct object" a bit
This shrinks "struct object" by a small amount, by getting rid of the
"struct type *" pointer and replacing it with a 3-bit bitfield instead.
In addition, we merge the bitfields and the "flags" field, which
incidentally should also remove a useless 4-byte padding from the object
when in 64-bit mode.
Now, our "struct object" is still too damn large, but it's now less
obviously bloated, and of the remaining fields, only the "util" (which is
not used by most things) is clearly something that should be eventually
discarded.
This shrinks the "git-rev-list --all" memory use by about 2.5% on the
kernel archive (and, perhaps more importantly, on the larger mozilla
archive). That may not sound like much, but I suspect it's more on a
64-bit platform.
There are other remaining inefficiencies (the parent lists, for example,
probably have horrible malloc overhead), but this was pretty obvious.
Most of the patch is just changing the comparison of the "type" pointer
from one of the constant string pointers to the appropriate new TYPE_xxx
small integer constant.
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-06-14 23:45:13 +00:00
|
|
|
unsigned type : TYPE_BITS;
|
|
|
|
|
unsigned flags : FLAG_BITS;
|
2005-04-18 18:39:48 +00:00
|
|
|
unsigned char sha1[20];
|
|
|
|
|
};
|
|
|
|
|
|
2005-09-16 21:55:33 +00:00
|
|
|
extern int track_object_refs;
|
2007-02-26 19:55:58 +00:00
|
|
|
|
|
|
|
|
extern const char *typename(unsigned int type);
|
|
|
|
|
extern int type_from_string(const char *str);
|
Shrink "struct object" a bit
This shrinks "struct object" by a small amount, by getting rid of the
"struct type *" pointer and replacing it with a 3-bit bitfield instead.
In addition, we merge the bitfields and the "flags" field, which
incidentally should also remove a useless 4-byte padding from the object
when in 64-bit mode.
Now, our "struct object" is still too damn large, but it's now less
obviously bloated, and of the remaining fields, only the "util" (which is
not used by most things) is clearly something that should be eventually
discarded.
This shrinks the "git-rev-list --all" memory use by about 2.5% on the
kernel archive (and, perhaps more importantly, on the larger mozilla
archive). That may not sound like much, but I suspect it's more on a
64-bit platform.
There are other remaining inefficiencies (the parent lists, for example,
probably have horrible malloc overhead), but this was pretty obvious.
Most of the patch is just changing the comparison of the "type" pointer
from one of the constant string pointers to the appropriate new TYPE_xxx
small integer constant.
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-06-14 23:45:13 +00:00
|
|
|
|
2006-06-30 04:38:55 +00:00
|
|
|
extern unsigned int get_max_object_index(void);
|
|
|
|
|
extern struct object *get_indexed_object(unsigned int);
|
2006-06-18 18:45:02 +00:00
|
|
|
extern struct object_refs *lookup_object_refs(struct object *);
|
|
|
|
|
|
2005-06-22 00:35:10 +00:00
|
|
|
/** Internal only **/
|
2005-06-03 15:05:39 +00:00
|
|
|
struct object *lookup_object(const unsigned char *sha1);
|
2005-04-18 18:39:48 +00:00
|
|
|
|
2005-06-03 15:05:39 +00:00
|
|
|
void created_object(const unsigned char *sha1, struct object *obj);
|
2005-04-18 18:39:48 +00:00
|
|
|
|
2005-04-28 14:46:33 +00:00
|
|
|
/** Returns the object, having parsed it to find out what it is. **/
|
2005-06-03 15:05:39 +00:00
|
|
|
struct object *parse_object(const unsigned char *sha1);
|
2005-04-28 14:46:33 +00:00
|
|
|
|
2006-09-15 20:30:02 +00:00
|
|
|
/* Given the result of read_sha1_file(), returns the object after
|
|
|
|
|
* parsing it. eaten_p indicates if the object has a borrowed copy
|
|
|
|
|
* of buffer and the caller should not free() it.
|
|
|
|
|
*/
|
2007-02-26 19:55:59 +00:00
|
|
|
struct object *parse_object_buffer(const unsigned char *sha1, enum object_type type, unsigned long size, void *buffer, int *eaten_p);
|
2006-09-15 20:30:02 +00:00
|
|
|
|
2005-08-02 23:45:48 +00:00
|
|
|
/** Returns the object, with potentially excess memory allocated. **/
|
|
|
|
|
struct object *lookup_unknown_object(const unsigned char *sha1);
|
|
|
|
|
|
2005-11-17 05:32:44 +00:00
|
|
|
struct object_refs *alloc_object_refs(unsigned count);
|
|
|
|
|
void set_object_refs(struct object *obj, struct object_refs *refs);
|
2005-04-18 18:39:48 +00:00
|
|
|
|
|
|
|
|
void mark_reachable(struct object *obj, unsigned int mask);
|
|
|
|
|
|
2005-08-02 23:45:48 +00:00
|
|
|
struct object_list *object_list_insert(struct object *item,
|
|
|
|
|
struct object_list **list_p);
|
|
|
|
|
|
2005-09-05 06:04:18 +00:00
|
|
|
void object_list_append(struct object *item,
|
|
|
|
|
struct object_list **list_p);
|
|
|
|
|
|
2005-08-02 23:45:48 +00:00
|
|
|
unsigned object_list_length(struct object_list *list);
|
|
|
|
|
|
|
|
|
|
int object_list_contains(struct object_list *list, struct object *obj);
|
|
|
|
|
|
Add "named object array" concept
We've had this notion of a "object_list" for a long time, which eventually
grew a "name" member because some users (notably git-rev-list) wanted to
name each object as it is generated.
That object_list is great for some things, but it isn't all that wonderful
for others, and the "name" member is generally not used by everybody.
This patch splits the users of the object_list array up into two: the
traditional list users, who want the list-like format, and who don't
actually use or want the name. And another class of users that really used
the list as an extensible array, and generally wanted to name the objects.
The patch is fairly straightforward, but it's also biggish. Most of it
really just cleans things up: switching the revision parsing and listing
over to the array makes things like the builtin-diff usage much simpler
(we now see exactly how many members the array has, and we don't get the
objects reversed from the order they were on the command line).
One of the main reasons for doing this at all is that the malloc overhead
of the simple object list was actually pretty high, and the array is just
a lot denser. So this patch brings down memory usage by git-rev-list by
just under 3% (on top of all the other memory use optimizations) on the
mozilla archive.
It does add more lines than it removes, and more importantly, it adds a
whole new infrastructure for maintaining lists of objects, but on the
other hand, the new dynamic array code is pretty obvious. The change to
builtin-diff-tree.c shows a fairly good example of why an array interface
is sometimes more natural, and just much simpler for everybody.
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-06-20 00:42:35 +00:00
|
|
|
/* Object array handling .. */
|
|
|
|
|
void add_object_array(struct object *obj, const char *name, struct object_array *array);
|
|
|
|
|
|
2005-04-18 18:39:48 +00:00
|
|
|
#endif /* OBJECT_H */
|