2009-01-23 10:06:53 +01:00
|
|
|
#include "cache.h"
|
|
|
|
#include "sha1-lookup.h"
|
|
|
|
#include "refs.h"
|
Fix sparse warnings
Fix warnings from 'make check'.
- These files don't include 'builtin.h' causing sparse to complain that
cmd_* isn't declared:
builtin/clone.c:364, builtin/fetch-pack.c:797,
builtin/fmt-merge-msg.c:34, builtin/hash-object.c:78,
builtin/merge-index.c:69, builtin/merge-recursive.c:22
builtin/merge-tree.c:341, builtin/mktag.c:156, builtin/notes.c:426
builtin/notes.c:822, builtin/pack-redundant.c:596,
builtin/pack-refs.c:10, builtin/patch-id.c:60, builtin/patch-id.c:149,
builtin/remote.c:1512, builtin/remote-ext.c:240,
builtin/remote-fd.c:53, builtin/reset.c:236, builtin/send-pack.c:384,
builtin/unpack-file.c:25, builtin/var.c:75
- These files have symbols which should be marked static since they're
only file scope:
submodule.c:12, diff.c:631, replace_object.c:92, submodule.c:13,
submodule.c:14, trace.c:78, transport.c:195, transport-helper.c:79,
unpack-trees.c:19, url.c:3, url.c:18, url.c:104, url.c:117, url.c:123,
url.c:129, url.c:136, thread-utils.c:21, thread-utils.c:48
- These files redeclare symbols to be different types:
builtin/index-pack.c:210, parse-options.c:564, parse-options.c:571,
usage.c:49, usage.c:58, usage.c:63, usage.c:72
- These files use a literal integer 0 when they really should use a NULL
pointer:
daemon.c:663, fast-import.c:2942, imap-send.c:1072, notes-merge.c:362
While we're in the area, clean up some unused #includes in builtin files
(mostly exec_cmd.h).
Signed-off-by: Stephen Boyd <bebarino@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2011-03-22 08:51:05 +01:00
|
|
|
#include "commit.h"
|
2009-01-23 10:06:53 +01:00
|
|
|
|
2014-02-21 17:32:03 +01:00
|
|
|
/*
|
|
|
|
* An array of replacements. The array is kept sorted by the original
|
|
|
|
* sha1.
|
|
|
|
*/
|
2009-01-23 10:06:53 +01:00
|
|
|
static struct replace_object {
|
2014-02-21 17:32:03 +01:00
|
|
|
unsigned char original[20];
|
|
|
|
unsigned char replacement[20];
|
2009-01-23 10:06:53 +01:00
|
|
|
} **replace_object;
|
|
|
|
|
|
|
|
static int replace_object_alloc, replace_object_nr;
|
|
|
|
|
|
|
|
static const unsigned char *replace_sha1_access(size_t index, void *table)
|
|
|
|
{
|
|
|
|
struct replace_object **replace = table;
|
2014-02-21 17:32:03 +01:00
|
|
|
return replace[index]->original;
|
2009-01-23 10:06:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
static int replace_object_pos(const unsigned char *sha1)
|
|
|
|
{
|
|
|
|
return sha1_pos(sha1, replace_object, replace_object_nr,
|
|
|
|
replace_sha1_access);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int register_replace_object(struct replace_object *replace,
|
|
|
|
int ignore_dups)
|
|
|
|
{
|
2014-02-21 17:32:03 +01:00
|
|
|
int pos = replace_object_pos(replace->original);
|
2009-01-23 10:06:53 +01:00
|
|
|
|
|
|
|
if (0 <= pos) {
|
|
|
|
if (ignore_dups)
|
|
|
|
free(replace);
|
|
|
|
else {
|
|
|
|
free(replace_object[pos]);
|
|
|
|
replace_object[pos] = replace;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
pos = -pos - 1;
|
2014-03-03 23:31:56 +01:00
|
|
|
ALLOC_GROW(replace_object, replace_object_nr + 1, replace_object_alloc);
|
|
|
|
replace_object_nr++;
|
2009-01-23 10:06:53 +01:00
|
|
|
if (pos < replace_object_nr)
|
|
|
|
memmove(replace_object + pos + 1,
|
|
|
|
replace_object + pos,
|
|
|
|
(replace_object_nr - pos - 1) *
|
|
|
|
sizeof(*replace_object));
|
|
|
|
replace_object[pos] = replace;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int register_replace_ref(const char *refname,
|
2015-05-25 20:39:02 +02:00
|
|
|
const struct object_id *oid,
|
2009-01-23 10:06:53 +01:00
|
|
|
int flag, void *cb_data)
|
|
|
|
{
|
|
|
|
/* Get sha1 from refname */
|
|
|
|
const char *slash = strrchr(refname, '/');
|
|
|
|
const char *hash = slash ? slash + 1 : refname;
|
|
|
|
struct replace_object *repl_obj = xmalloc(sizeof(*repl_obj));
|
|
|
|
|
2014-02-21 17:32:03 +01:00
|
|
|
if (strlen(hash) != 40 || get_sha1_hex(hash, repl_obj->original)) {
|
2009-01-23 10:06:53 +01:00
|
|
|
free(repl_obj);
|
|
|
|
warning("bad replace ref name: %s", refname);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Copy sha1 from the read ref */
|
2015-05-25 20:39:02 +02:00
|
|
|
hashcpy(repl_obj->replacement, oid->hash);
|
2009-01-23 10:06:53 +01:00
|
|
|
|
|
|
|
/* Register new object */
|
|
|
|
if (register_replace_object(repl_obj, 1))
|
|
|
|
die("duplicate replace ref: %s", refname);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void prepare_replace_object(void)
|
|
|
|
{
|
|
|
|
static int replace_object_prepared;
|
|
|
|
|
|
|
|
if (replace_object_prepared)
|
|
|
|
return;
|
|
|
|
|
2015-05-25 20:39:02 +02:00
|
|
|
for_each_replace_ref(register_replace_ref, NULL);
|
2009-01-23 10:06:53 +01:00
|
|
|
replace_object_prepared = 1;
|
2011-05-15 21:54:53 +02:00
|
|
|
if (!replace_object_nr)
|
2014-02-18 12:24:55 +01:00
|
|
|
check_replace_refs = 0;
|
2009-01-23 10:06:53 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
/* We allow "recursive" replacement. Only within reason, though */
|
|
|
|
#define MAXREPLACEDEPTH 5
|
|
|
|
|
2014-02-28 17:29:16 +01:00
|
|
|
/*
|
|
|
|
* If a replacement for object sha1 has been set up, return the
|
|
|
|
* replacement object's name (replaced recursively, if necessary).
|
|
|
|
* The return value is either sha1 or a pointer to a
|
|
|
|
* permanently-allocated value. This function always respects replace
|
|
|
|
* references, regardless of the value of check_replace_refs.
|
|
|
|
*/
|
2011-05-15 21:54:53 +02:00
|
|
|
const unsigned char *do_lookup_replace_object(const unsigned char *sha1)
|
2009-01-23 10:06:53 +01:00
|
|
|
{
|
|
|
|
int pos, depth = MAXREPLACEDEPTH;
|
|
|
|
const unsigned char *cur = sha1;
|
|
|
|
|
|
|
|
prepare_replace_object();
|
|
|
|
|
|
|
|
/* Try to recursively replace the object */
|
|
|
|
do {
|
|
|
|
if (--depth < 0)
|
|
|
|
die("replace depth too high for object %s",
|
|
|
|
sha1_to_hex(sha1));
|
|
|
|
|
|
|
|
pos = replace_object_pos(cur);
|
|
|
|
if (0 <= pos)
|
2014-02-21 17:32:03 +01:00
|
|
|
cur = replace_object[pos]->replacement;
|
2009-01-23 10:06:53 +01:00
|
|
|
} while (0 <= pos);
|
|
|
|
|
|
|
|
return cur;
|
|
|
|
}
|