2005-04-28 16:46:33 +02:00
|
|
|
#include "cache.h"
|
2006-01-07 10:33:54 +01:00
|
|
|
#include "tag.h"
|
2007-02-26 20:56:00 +01:00
|
|
|
#include "commit.h"
|
|
|
|
#include "tree.h"
|
|
|
|
#include "blob.h"
|
2005-04-28 16:46:33 +02:00
|
|
|
|
|
|
|
const char *tag_type = "tag";
|
|
|
|
|
2005-11-03 00:19:13 +01:00
|
|
|
struct object *deref_tag(struct object *o, const char *warn, int warnlen)
|
2005-08-05 09:47:56 +02:00
|
|
|
{
|
2006-07-12 05:45:31 +02:00
|
|
|
while (o && o->type == OBJ_TAG)
|
2005-08-05 09:47:56 +02:00
|
|
|
o = parse_object(((struct tag *)o)->tagged->sha1);
|
2005-11-03 00:19:13 +01:00
|
|
|
if (!o && warn) {
|
|
|
|
if (!warnlen)
|
|
|
|
warnlen = strlen(warn);
|
|
|
|
error("missing object referenced by '%.*s'", warnlen, warn);
|
|
|
|
}
|
2005-08-05 09:47:56 +02:00
|
|
|
return o;
|
|
|
|
}
|
|
|
|
|
2005-06-03 17:05:39 +02:00
|
|
|
struct tag *lookup_tag(const unsigned char *sha1)
|
2005-04-28 16:46:33 +02:00
|
|
|
{
|
2007-04-17 07:11:43 +02:00
|
|
|
struct object *obj = lookup_object(sha1);
|
|
|
|
if (!obj)
|
|
|
|
return create_object(sha1, OBJ_TAG, alloc_tag_node());
|
2005-05-20 22:59:17 +02:00
|
|
|
if (!obj->type)
|
2006-07-12 05:45:31 +02:00
|
|
|
obj->type = OBJ_TAG;
|
|
|
|
if (obj->type != OBJ_TAG) {
|
2007-05-29 01:21:25 +02:00
|
|
|
error("Object %s is a %s, not a tag",
|
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-15 01:45:13 +02:00
|
|
|
sha1_to_hex(sha1), typename(obj->type));
|
2005-04-28 16:46:33 +02:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return (struct tag *) obj;
|
|
|
|
}
|
|
|
|
|
2005-05-06 19:48:34 +02:00
|
|
|
int parse_tag_buffer(struct tag *item, void *data, unsigned long size)
|
2005-04-28 16:46:33 +02:00
|
|
|
{
|
2005-04-30 18:51:03 +02:00
|
|
|
int typelen, taglen;
|
2007-02-26 20:56:00 +01:00
|
|
|
unsigned char sha1[20];
|
2005-04-30 18:51:03 +02:00
|
|
|
const char *type_line, *tag_line, *sig_line;
|
2005-06-22 02:35:10 +02:00
|
|
|
char type[20];
|
2008-01-06 20:03:10 +01:00
|
|
|
const char *start = data;
|
2005-04-30 18:51:03 +02:00
|
|
|
|
2005-04-28 16:46:33 +02:00
|
|
|
if (item->object.parsed)
|
|
|
|
return 0;
|
|
|
|
item->object.parsed = 1;
|
|
|
|
|
|
|
|
if (size < 64)
|
2005-05-06 19:48:34 +02:00
|
|
|
return -1;
|
2007-02-26 20:56:00 +01:00
|
|
|
if (memcmp("object ", data, 7) || get_sha1_hex((char *) data + 7, sha1))
|
2005-05-06 19:48:34 +02:00
|
|
|
return -1;
|
2005-04-28 16:46:33 +02:00
|
|
|
|
2006-06-18 17:18:09 +02:00
|
|
|
type_line = (char *) data + 48;
|
2005-04-28 16:46:33 +02:00
|
|
|
if (memcmp("\ntype ", type_line-1, 6))
|
2005-05-06 19:48:34 +02:00
|
|
|
return -1;
|
2005-04-28 16:46:33 +02:00
|
|
|
|
2008-01-06 20:03:10 +01:00
|
|
|
tag_line = memchr(type_line, '\n', size - (type_line - start));
|
2005-04-28 16:46:33 +02:00
|
|
|
if (!tag_line || memcmp("tag ", ++tag_line, 4))
|
2005-05-06 19:48:34 +02:00
|
|
|
return -1;
|
2005-04-28 16:46:33 +02:00
|
|
|
|
2008-01-06 20:03:10 +01:00
|
|
|
sig_line = memchr(tag_line, '\n', size - (tag_line - start));
|
2005-04-28 16:46:33 +02:00
|
|
|
if (!sig_line)
|
2005-05-06 19:48:34 +02:00
|
|
|
return -1;
|
2005-04-28 16:46:33 +02:00
|
|
|
sig_line++;
|
|
|
|
|
|
|
|
typelen = tag_line - type_line - strlen("type \n");
|
|
|
|
if (typelen >= 20)
|
2005-05-06 19:48:34 +02:00
|
|
|
return -1;
|
2005-06-22 02:35:10 +02:00
|
|
|
memcpy(type, type_line + 5, typelen);
|
|
|
|
type[typelen] = '\0';
|
2005-04-28 16:46:33 +02:00
|
|
|
taglen = sig_line - tag_line - strlen("tag \n");
|
2007-09-16 00:32:36 +02:00
|
|
|
item->tag = xmemdupz(tag_line + 4, taglen);
|
2005-04-28 16:46:33 +02:00
|
|
|
|
2007-02-26 20:56:00 +01:00
|
|
|
if (!strcmp(type, blob_type)) {
|
|
|
|
item->tagged = &lookup_blob(sha1)->object;
|
|
|
|
} else if (!strcmp(type, tree_type)) {
|
|
|
|
item->tagged = &lookup_tree(sha1)->object;
|
|
|
|
} else if (!strcmp(type, commit_type)) {
|
|
|
|
item->tagged = &lookup_commit(sha1)->object;
|
|
|
|
} else if (!strcmp(type, tag_type)) {
|
|
|
|
item->tagged = &lookup_tag(sha1)->object;
|
|
|
|
} else {
|
|
|
|
error("Unknown type %s", type);
|
|
|
|
item->tagged = NULL;
|
|
|
|
}
|
|
|
|
|
2005-04-28 16:46:33 +02:00
|
|
|
return 0;
|
2005-05-06 19:48:34 +02:00
|
|
|
}
|
2005-05-04 19:44:15 +02:00
|
|
|
|
2005-05-06 19:48:34 +02:00
|
|
|
int parse_tag(struct tag *item)
|
|
|
|
{
|
2007-02-26 20:55:59 +01:00
|
|
|
enum object_type type;
|
2005-05-06 19:48:34 +02:00
|
|
|
void *data;
|
|
|
|
unsigned long size;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
if (item->object.parsed)
|
|
|
|
return 0;
|
2007-02-26 20:55:59 +01:00
|
|
|
data = read_sha1_file(item->object.sha1, &type, &size);
|
2005-05-06 19:48:34 +02:00
|
|
|
if (!data)
|
|
|
|
return error("Could not read %s",
|
|
|
|
sha1_to_hex(item->object.sha1));
|
2007-02-26 20:55:59 +01:00
|
|
|
if (type != OBJ_TAG) {
|
2005-05-06 19:48:34 +02:00
|
|
|
free(data);
|
|
|
|
return error("Object %s not a tag",
|
|
|
|
sha1_to_hex(item->object.sha1));
|
|
|
|
}
|
|
|
|
ret = parse_tag_buffer(item, data, size);
|
2005-05-04 19:44:15 +02:00
|
|
|
free(data);
|
2005-05-06 19:48:34 +02:00
|
|
|
return ret;
|
2005-04-28 16:46:33 +02:00
|
|
|
}
|