2015-11-09 21:34:01 +08:00
|
|
|
/*
|
|
|
|
* The backend-independent part of the reference module.
|
|
|
|
*/
|
|
|
|
|
2005-06-07 04:31:29 +08:00
|
|
|
#include "cache.h"
|
2017-06-15 02:07:36 +08:00
|
|
|
#include "config.h"
|
2017-02-10 19:16:15 +08:00
|
|
|
#include "hashmap.h"
|
2014-10-01 18:28:42 +08:00
|
|
|
#include "lockfile.h"
|
2017-04-16 14:41:26 +08:00
|
|
|
#include "iterator.h"
|
2006-12-20 06:34:12 +08:00
|
|
|
#include "refs.h"
|
2015-11-10 19:42:36 +08:00
|
|
|
#include "refs/refs-internal.h"
|
2006-11-20 05:22:44 +08:00
|
|
|
#include "object.h"
|
|
|
|
#include "tag.h"
|
2017-03-26 10:42:31 +08:00
|
|
|
#include "submodule.h"
|
2017-04-24 18:01:22 +08:00
|
|
|
#include "worktree.h"
|
2014-12-12 16:57:02 +08:00
|
|
|
|
2016-09-05 00:08:10 +08:00
|
|
|
/*
|
|
|
|
* List of all available backends
|
|
|
|
*/
|
|
|
|
static struct ref_storage_be *refs_backends = &refs_be_files;
|
|
|
|
|
|
|
|
static struct ref_storage_be *find_ref_storage_backend(const char *name)
|
|
|
|
{
|
|
|
|
struct ref_storage_be *be;
|
|
|
|
for (be = refs_backends; be; be = be->next)
|
|
|
|
if (!strcmp(be->name, name))
|
|
|
|
return be;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ref_storage_backend_exists(const char *name)
|
|
|
|
{
|
|
|
|
return find_ref_storage_backend(name) != NULL;
|
|
|
|
}
|
|
|
|
|
2012-04-10 13:30:13 +08:00
|
|
|
/*
|
2014-06-04 11:38:10 +08:00
|
|
|
* How to handle various characters in refnames:
|
|
|
|
* 0: An acceptable character for refs
|
2014-07-29 01:41:53 +08:00
|
|
|
* 1: End-of-component
|
|
|
|
* 2: ., look for a preceding . to reject .. in refs
|
|
|
|
* 3: {, look for a preceding @ to reject @{ in refs
|
2015-07-23 05:05:32 +08:00
|
|
|
* 4: A bad character: ASCII control characters, and
|
2015-07-23 05:05:33 +08:00
|
|
|
* ":", "?", "[", "\", "^", "~", SP, or TAB
|
|
|
|
* 5: *, reject unless REFNAME_REFSPEC_PATTERN is set
|
2014-06-04 11:38:10 +08:00
|
|
|
*/
|
|
|
|
static unsigned char refname_disposition[256] = {
|
2014-07-29 01:41:53 +08:00
|
|
|
1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
|
|
|
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
2015-07-23 05:05:33 +08:00
|
|
|
4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 2, 1,
|
2014-07-29 01:41:53 +08:00
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4,
|
2014-06-04 11:38:10 +08:00
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
2014-07-29 01:41:53 +08:00
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4
|
2014-06-04 11:38:10 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Try to read one refname component from the front of refname.
|
|
|
|
* Return the length of the component found, or -1 if the component is
|
|
|
|
* not legal. It is legal if it is something reasonable to have under
|
|
|
|
* ".git/refs/"; We do not like it if:
|
2012-04-10 13:30:13 +08:00
|
|
|
*
|
|
|
|
* - any path component of it begins with ".", or
|
|
|
|
* - it has double dots "..", or
|
2015-07-23 05:05:32 +08:00
|
|
|
* - it has ASCII control characters, or
|
2015-07-23 05:05:33 +08:00
|
|
|
* - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or
|
|
|
|
* - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or
|
2015-07-23 05:05:32 +08:00
|
|
|
* - it ends with a "/", or
|
|
|
|
* - it ends with ".lock", or
|
|
|
|
* - it contains a "@{" portion
|
2012-04-10 13:30:13 +08:00
|
|
|
*/
|
2015-07-23 05:05:33 +08:00
|
|
|
static int check_refname_component(const char *refname, int *flags)
|
2012-04-10 13:30:13 +08:00
|
|
|
{
|
|
|
|
const char *cp;
|
|
|
|
char last = '\0';
|
|
|
|
|
|
|
|
for (cp = refname; ; cp++) {
|
2014-06-04 11:38:10 +08:00
|
|
|
int ch = *cp & 255;
|
|
|
|
unsigned char disp = refname_disposition[ch];
|
|
|
|
switch (disp) {
|
2014-07-29 01:41:53 +08:00
|
|
|
case 1:
|
2014-06-04 11:38:10 +08:00
|
|
|
goto out;
|
2014-07-29 01:41:53 +08:00
|
|
|
case 2:
|
2014-06-04 11:38:10 +08:00
|
|
|
if (last == '.')
|
|
|
|
return -1; /* Refname contains "..". */
|
|
|
|
break;
|
2014-07-29 01:41:53 +08:00
|
|
|
case 3:
|
2014-06-04 11:38:10 +08:00
|
|
|
if (last == '@')
|
|
|
|
return -1; /* Refname contains "@{". */
|
2012-04-10 13:30:13 +08:00
|
|
|
break;
|
2014-07-29 01:41:53 +08:00
|
|
|
case 4:
|
2014-06-04 11:38:10 +08:00
|
|
|
return -1;
|
2015-07-23 05:05:33 +08:00
|
|
|
case 5:
|
|
|
|
if (!(*flags & REFNAME_REFSPEC_PATTERN))
|
|
|
|
return -1; /* refspec can't be a pattern */
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unset the pattern flag so that we only accept
|
|
|
|
* a single asterisk for one side of refspec.
|
|
|
|
*/
|
|
|
|
*flags &= ~ REFNAME_REFSPEC_PATTERN;
|
|
|
|
break;
|
2014-06-04 11:38:10 +08:00
|
|
|
}
|
2012-04-10 13:30:13 +08:00
|
|
|
last = ch;
|
|
|
|
}
|
2014-06-04 11:38:10 +08:00
|
|
|
out:
|
2012-04-10 13:30:13 +08:00
|
|
|
if (cp == refname)
|
2012-04-10 13:30:22 +08:00
|
|
|
return 0; /* Component has zero length. */
|
2014-09-27 03:22:22 +08:00
|
|
|
if (refname[0] == '.')
|
|
|
|
return -1; /* Component starts with '.'. */
|
2014-10-01 18:28:15 +08:00
|
|
|
if (cp - refname >= LOCK_SUFFIX_LEN &&
|
|
|
|
!memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN))
|
2012-04-10 13:30:13 +08:00
|
|
|
return -1; /* Refname ends with ".lock". */
|
|
|
|
return cp - refname;
|
|
|
|
}
|
|
|
|
|
2014-07-29 01:41:53 +08:00
|
|
|
int check_refname_format(const char *refname, int flags)
|
2012-04-10 13:30:13 +08:00
|
|
|
{
|
|
|
|
int component_len, component_count = 0;
|
|
|
|
|
Add new @ shortcut for HEAD
Typing 'HEAD' is tedious, especially when we can use '@' instead.
The reason for choosing '@' is that it follows naturally from the
ref@op syntax (e.g. HEAD@{u}), except we have no ref, and no
operation, and when we don't have those, it makes sens to assume
'HEAD'.
So now we can use 'git show @~1', and all that goody goodness.
Until now '@' was a valid name, but it conflicts with this idea, so
let's make it invalid. Probably very few people, if any, used this name.
Signed-off-by: Felipe Contreras <felipe.contreras@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-09-02 14:34:30 +08:00
|
|
|
if (!strcmp(refname, "@"))
|
|
|
|
/* Refname is a single character '@'. */
|
|
|
|
return -1;
|
|
|
|
|
2012-04-10 13:30:13 +08:00
|
|
|
while (1) {
|
|
|
|
/* We are at the start of a path component. */
|
2015-07-23 05:05:33 +08:00
|
|
|
component_len = check_refname_component(refname, &flags);
|
|
|
|
if (component_len <= 0)
|
|
|
|
return -1;
|
|
|
|
|
2012-04-10 13:30:13 +08:00
|
|
|
component_count++;
|
|
|
|
if (refname[component_len] == '\0')
|
|
|
|
break;
|
|
|
|
/* Skip to next component. */
|
|
|
|
refname += component_len + 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (refname[component_len - 1] == '.')
|
|
|
|
return -1; /* Refname ends with '.'. */
|
|
|
|
if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2)
|
|
|
|
return -1; /* Refname has only one component. */
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-11-10 19:42:36 +08:00
|
|
|
int refname_is_safe(const char *refname)
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
{
|
2016-04-27 18:39:11 +08:00
|
|
|
const char *rest;
|
|
|
|
|
|
|
|
if (skip_prefix(refname, "refs/", &rest)) {
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
char *buf;
|
|
|
|
int result;
|
2016-04-27 18:40:39 +08:00
|
|
|
size_t restlen = strlen(rest);
|
|
|
|
|
|
|
|
/* rest must not be empty, or start or end with "/" */
|
|
|
|
if (!restlen || *rest == '/' || rest[restlen - 1] == '/')
|
|
|
|
return 0;
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Does the refname try to escape refs/?
|
|
|
|
* For example: refs/foo/../bar is safe but refs/foo/../../bar
|
|
|
|
* is not.
|
|
|
|
*/
|
2016-04-27 18:40:39 +08:00
|
|
|
buf = xmallocz(restlen);
|
|
|
|
result = !normalize_path_copy(buf, rest) && !strcmp(buf, rest);
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
free(buf);
|
|
|
|
return result;
|
|
|
|
}
|
2016-04-27 18:42:27 +08:00
|
|
|
|
|
|
|
do {
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
if (!isupper(*refname) && *refname != '_')
|
|
|
|
return 0;
|
|
|
|
refname++;
|
2016-04-27 18:42:27 +08:00
|
|
|
} while (*refname);
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2017-06-23 15:01:37 +08:00
|
|
|
/*
|
|
|
|
* Return true if refname, which has the specified oid and flags, can
|
|
|
|
* be resolved to an object in the database. If the referred-to object
|
|
|
|
* does not exist, emit a warning and return false.
|
|
|
|
*/
|
|
|
|
int ref_resolves_to_object(const char *refname,
|
|
|
|
const struct object_id *oid,
|
|
|
|
unsigned int flags)
|
|
|
|
{
|
|
|
|
if (flags & REF_ISBROKEN)
|
|
|
|
return 0;
|
|
|
|
if (!has_sha1_file(oid->hash)) {
|
|
|
|
error("%s does not point to a valid object!", refname);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
char *refs_resolve_refdup(struct ref_store *refs,
|
|
|
|
const char *refname, int resolve_flags,
|
|
|
|
unsigned char *sha1, int *flags)
|
|
|
|
{
|
|
|
|
const char *result;
|
|
|
|
|
|
|
|
result = refs_resolve_ref_unsafe(refs, refname, resolve_flags,
|
|
|
|
sha1, flags);
|
|
|
|
return xstrdup_or_null(result);
|
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
char *resolve_refdup(const char *refname, int resolve_flags,
|
|
|
|
unsigned char *sha1, int *flags)
|
Start handling references internally as a sorted in-memory list
This also adds some very rudimentary support for the notion of packed
refs. HOWEVER! At this point it isn't used to actually look up a ref
yet, only for listing them (ie "for_each_ref()" and friends see the
packed refs, but none of the other single-ref lookup routines).
Note how we keep two separate lists: one for the loose refs, and one for
the packed refs we read. That's so that we can easily keep the two apart,
and read only one set or the other (and still always make sure that the
loose refs take precedence).
[ From this, it's not actually obvious why we'd keep the two separate
lists, but it's important to have the packed refs on their own list
later on, when I add support for looking up a single loose one.
For that case, we will want to read _just_ the packed refs in case the
single-ref lookup fails, yet we may end up needing the other list at
some point in the future, so keeping them separated is important ]
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Signed-off-by: Junio C Hamano <junkio@cox.net>
2006-09-12 07:37:32 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_resolve_refdup(get_main_ref_store(),
|
|
|
|
refname, resolve_flags,
|
|
|
|
sha1, flags);
|
2011-12-12 13:38:22 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
/* The argument to filter_refs */
|
|
|
|
struct ref_filter {
|
|
|
|
const char *pattern;
|
|
|
|
each_ref_fn *fn;
|
|
|
|
void *cb_data;
|
|
|
|
};
|
2012-04-10 13:30:26 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_read_ref_full(struct ref_store *refs, const char *refname,
|
|
|
|
int resolve_flags, unsigned char *sha1, int *flags)
|
2012-04-10 13:30:21 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
if (refs_resolve_ref_unsafe(refs, refname, resolve_flags, sha1, flags))
|
2015-11-09 21:34:01 +08:00
|
|
|
return 0;
|
|
|
|
return -1;
|
2012-04-10 13:30:21 +08:00
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)
|
|
|
|
{
|
|
|
|
return refs_read_ref_full(get_main_ref_store(), refname,
|
|
|
|
resolve_flags, sha1, flags);
|
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int read_ref(const char *refname, unsigned char *sha1)
|
2011-12-12 13:38:22 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);
|
2007-04-17 09:42:50 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int ref_exists(const char *refname)
|
2012-04-10 13:30:13 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
unsigned char sha1[20];
|
|
|
|
return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);
|
2012-04-10 13:30:13 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
static int filter_refs(const char *refname, const struct object_id *oid,
|
|
|
|
int flags, void *data)
|
2012-04-10 13:30:26 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
struct ref_filter *filter = (struct ref_filter *)data;
|
|
|
|
|
2017-06-23 05:38:08 +08:00
|
|
|
if (wildmatch(filter->pattern, refname, 0))
|
2015-11-09 21:34:01 +08:00
|
|
|
return 0;
|
|
|
|
return filter->fn(refname, oid, flags, filter->cb_data);
|
2012-04-10 13:30:26 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)
|
2007-04-17 09:42:50 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
struct object *o = lookup_unknown_object(name);
|
2007-04-17 09:42:50 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
if (o->type == OBJ_NONE) {
|
|
|
|
int type = sha1_object_info(name, NULL);
|
|
|
|
if (type < 0 || !object_as_type(o, type, 0))
|
|
|
|
return PEEL_INVALID;
|
|
|
|
}
|
2012-04-10 13:30:13 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
if (o->type != OBJ_TAG)
|
|
|
|
return PEEL_NON_TAG;
|
2012-05-23 05:03:29 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
o = deref_tag_noverify(o);
|
|
|
|
if (!o)
|
|
|
|
return PEEL_INVALID;
|
|
|
|
|
2015-12-11 04:36:13 +08:00
|
|
|
hashcpy(sha1, o->oid.hash);
|
2015-11-09 21:34:01 +08:00
|
|
|
return PEEL_PEELED;
|
2012-05-23 05:03:29 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
struct warn_if_dangling_data {
|
|
|
|
FILE *fp;
|
|
|
|
const char *refname;
|
|
|
|
const struct string_list *refnames;
|
|
|
|
const char *msg_fmt;
|
|
|
|
};
|
2012-04-10 13:30:13 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
static int warn_if_dangling_symref(const char *refname, const struct object_id *oid,
|
|
|
|
int flags, void *cb_data)
|
|
|
|
{
|
|
|
|
struct warn_if_dangling_data *d = cb_data;
|
|
|
|
const char *resolves_to;
|
|
|
|
struct object_id junk;
|
2012-04-10 13:30:13 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
if (!(flags & REF_ISSYMREF))
|
|
|
|
return 0;
|
2012-04-10 13:30:13 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
resolves_to = resolve_ref_unsafe(refname, 0, junk.hash, NULL);
|
|
|
|
if (!resolves_to
|
|
|
|
|| (d->refname
|
|
|
|
? strcmp(resolves_to, d->refname)
|
|
|
|
: !string_list_has_string(d->refnames, resolves_to))) {
|
|
|
|
return 0;
|
|
|
|
}
|
2012-04-10 13:30:13 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
fprintf(d->fp, d->msg_fmt, refname);
|
|
|
|
fputc('\n', d->fp);
|
|
|
|
return 0;
|
2012-04-10 13:30:13 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)
|
2012-04-25 06:45:11 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
struct warn_if_dangling_data data;
|
|
|
|
|
|
|
|
data.fp = fp;
|
|
|
|
data.refname = refname;
|
|
|
|
data.refnames = NULL;
|
|
|
|
data.msg_fmt = msg_fmt;
|
|
|
|
for_each_rawref(warn_if_dangling_symref, &data);
|
2012-04-25 06:45:11 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)
|
2012-04-10 13:30:26 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
struct warn_if_dangling_data data;
|
2012-04-10 13:30:26 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
data.fp = fp;
|
|
|
|
data.refname = NULL;
|
|
|
|
data.refnames = refnames;
|
|
|
|
data.msg_fmt = msg_fmt;
|
|
|
|
for_each_rawref(warn_if_dangling_symref, &data);
|
2012-04-10 13:30:26 +08:00
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_for_each_tag_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return refs_for_each_ref_in(refs, "refs/tags/", fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_tag_ref(each_ref_fn fn, void *cb_data)
|
2012-04-10 13:30:26 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_tag_ref(get_main_ref_store(), fn, cb_data);
|
2012-04-10 13:30:26 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
|
2013-04-23 03:52:27 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_tag_ref(get_submodule_ref_store(submodule),
|
|
|
|
fn, cb_data);
|
|
|
|
}
|
|
|
|
|
|
|
|
int refs_for_each_branch_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return refs_for_each_ref_in(refs, "refs/heads/", fn, cb_data);
|
2012-04-10 13:30:26 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_branch_ref(each_ref_fn fn, void *cb_data)
|
2012-04-10 13:30:26 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_branch_ref(get_main_ref_store(), fn, cb_data);
|
2012-04-10 13:30:26 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
|
2011-12-12 13:38:15 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_branch_ref(get_submodule_ref_store(submodule),
|
|
|
|
fn, cb_data);
|
|
|
|
}
|
|
|
|
|
|
|
|
int refs_for_each_remote_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return refs_for_each_ref_in(refs, "refs/remotes/", fn, cb_data);
|
2011-12-12 13:38:15 +08:00
|
|
|
}
|
2012-04-10 13:30:26 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_remote_ref(each_ref_fn fn, void *cb_data)
|
2011-09-30 06:11:42 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_remote_ref(get_main_ref_store(), fn, cb_data);
|
2011-12-12 13:38:15 +08:00
|
|
|
}
|
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
|
2011-09-30 06:11:42 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_remote_ref(get_submodule_ref_store(submodule),
|
|
|
|
fn, cb_data);
|
2013-04-23 03:52:18 +08:00
|
|
|
}
|
2007-04-17 09:42:50 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int head_ref_namespaced(each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
|
|
|
int ret = 0;
|
|
|
|
struct object_id oid;
|
|
|
|
int flag;
|
2007-04-17 09:42:50 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
strbuf_addf(&buf, "%sHEAD", get_git_namespace());
|
|
|
|
if (!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))
|
|
|
|
ret = fn(buf.buf, &oid, flag, cb_data);
|
|
|
|
strbuf_release(&buf);
|
2007-04-17 09:42:50 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
return ret;
|
2011-09-30 06:11:42 +08:00
|
|
|
}
|
2007-04-17 09:42:50 +08:00
|
|
|
|
2015-11-09 21:34:01 +08:00
|
|
|
int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,
|
|
|
|
const char *prefix, void *cb_data)
|
2013-04-23 03:52:18 +08:00
|
|
|
{
|
2015-11-09 21:34:01 +08:00
|
|
|
struct strbuf real_pattern = STRBUF_INIT;
|
|
|
|
struct ref_filter filter;
|
|
|
|
int ret;
|
2010-01-20 17:48:25 +08:00
|
|
|
|
2013-12-01 04:55:40 +08:00
|
|
|
if (!prefix && !starts_with(pattern, "refs/"))
|
2010-01-20 17:48:25 +08:00
|
|
|
strbuf_addstr(&real_pattern, "refs/");
|
2010-01-20 17:48:26 +08:00
|
|
|
else if (prefix)
|
|
|
|
strbuf_addstr(&real_pattern, prefix);
|
2010-01-20 17:48:25 +08:00
|
|
|
strbuf_addstr(&real_pattern, pattern);
|
|
|
|
|
2010-03-13 01:04:26 +08:00
|
|
|
if (!has_glob_specials(pattern)) {
|
2010-02-04 13:23:18 +08:00
|
|
|
/* Append implied '/' '*' if not present. */
|
use strbuf_complete to conditionally append slash
When working with paths in strbufs, we frequently want to
ensure that a directory contains a trailing slash before
appending to it. We can shorten this code (and make the
intent more obvious) by calling strbuf_complete.
Most of these cases are trivially identical conversions, but
there are two things to note:
- in a few cases we did not check that the strbuf is
non-empty (which would lead to an out-of-bounds memory
access). These were generally not triggerable in
practice, either from earlier assertions, or typically
because we would have just fed the strbuf to opendir(),
which would choke on an empty path.
- in a few cases we indexed the buffer with "original_len"
or similar, rather than the current sb->len, and it is
not immediately obvious from the diff that they are the
same. In all of these cases, I manually verified that
the strbuf does not change between the assignment and
the strbuf_complete call.
This does not convert cases which look like:
if (sb->len && !is_dir_sep(sb->buf[sb->len - 1]))
strbuf_addch(sb, '/');
as those are obviously semantically different. Some of these
cases arguably should be doing that, but that is out of
scope for this change, which aims purely for cleanup with no
behavior change (and at least it will make such sites easier
to find and examine in the future, as we can grep for
strbuf_complete).
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-09-25 05:08:35 +08:00
|
|
|
strbuf_complete(&real_pattern, '/');
|
2010-01-20 17:48:25 +08:00
|
|
|
/* No need to check for '*', there is none. */
|
|
|
|
strbuf_addch(&real_pattern, '*');
|
|
|
|
}
|
|
|
|
|
|
|
|
filter.pattern = real_pattern.buf;
|
|
|
|
filter.fn = fn;
|
|
|
|
filter.cb_data = cb_data;
|
|
|
|
ret = for_each_ref(filter_refs, &filter);
|
|
|
|
|
|
|
|
strbuf_release(&real_pattern);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2010-01-20 17:48:26 +08:00
|
|
|
int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)
|
|
|
|
{
|
|
|
|
return for_each_glob_ref_in(fn, pattern, NULL, cb_data);
|
|
|
|
}
|
|
|
|
|
2009-05-14 05:22:04 +08:00
|
|
|
const char *prettify_refname(const char *name)
|
2009-03-09 09:06:05 +08:00
|
|
|
{
|
2017-03-23 23:50:12 +08:00
|
|
|
if (skip_prefix(name, "refs/heads/", &name) ||
|
|
|
|
skip_prefix(name, "refs/tags/", &name) ||
|
|
|
|
skip_prefix(name, "refs/remotes/", &name))
|
|
|
|
; /* nothing */
|
|
|
|
return name;
|
2009-03-09 09:06:05 +08:00
|
|
|
}
|
|
|
|
|
2014-01-14 11:16:07 +08:00
|
|
|
static const char *ref_rev_parse_rules[] = {
|
add refname_match()
We use at least two rulesets for matching abbreviated refnames with
full refnames (starting with 'refs/'). git-rev-parse and git-fetch
use slightly different rules.
This commit introduces a new function refname_match
(const char *abbrev_name, const char *full_name, const char **rules).
abbrev_name is expanded using the rules and matched against full_name.
If a match is found the function returns true. rules is a NULL-terminate
list of format patterns with "%.*s", for example:
const char *ref_rev_parse_rules[] = {
"%.*s",
"refs/%.*s",
"refs/tags/%.*s",
"refs/heads/%.*s",
"refs/remotes/%.*s",
"refs/remotes/%.*s/HEAD",
NULL
};
Asterisks are included in the format strings because this is the form
required in sha1_name.c. Sharing the list with the functions there is
a good idea to avoid duplicating the rules. Hopefully this
facilitates unified matching rules in the future.
This commit makes the rules used by rev-parse for resolving refs to
sha1s available for string comparison. Before this change, the rules
were buried in get_sha1*() and dwim_ref().
A follow-up commit will refactor the rules used by fetch.
refname_match() will be used for matching refspecs in git-send-pack.
Thanks to Daniel Barkalow <barkalow@iabervon.org> for pointing
out that ref_matches_abbrev in remote.c solves a similar problem
and care should be taken to avoid confusion.
Signed-off-by: Steffen Prohaska <prohaska@zib.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2007-11-11 22:01:46 +08:00
|
|
|
"%.*s",
|
|
|
|
"refs/%.*s",
|
|
|
|
"refs/tags/%.*s",
|
|
|
|
"refs/heads/%.*s",
|
|
|
|
"refs/remotes/%.*s",
|
|
|
|
"refs/remotes/%.*s/HEAD",
|
|
|
|
NULL
|
|
|
|
};
|
|
|
|
|
2014-01-14 11:16:07 +08:00
|
|
|
int refname_match(const char *abbrev_name, const char *full_name)
|
add refname_match()
We use at least two rulesets for matching abbreviated refnames with
full refnames (starting with 'refs/'). git-rev-parse and git-fetch
use slightly different rules.
This commit introduces a new function refname_match
(const char *abbrev_name, const char *full_name, const char **rules).
abbrev_name is expanded using the rules and matched against full_name.
If a match is found the function returns true. rules is a NULL-terminate
list of format patterns with "%.*s", for example:
const char *ref_rev_parse_rules[] = {
"%.*s",
"refs/%.*s",
"refs/tags/%.*s",
"refs/heads/%.*s",
"refs/remotes/%.*s",
"refs/remotes/%.*s/HEAD",
NULL
};
Asterisks are included in the format strings because this is the form
required in sha1_name.c. Sharing the list with the functions there is
a good idea to avoid duplicating the rules. Hopefully this
facilitates unified matching rules in the future.
This commit makes the rules used by rev-parse for resolving refs to
sha1s available for string comparison. Before this change, the rules
were buried in get_sha1*() and dwim_ref().
A follow-up commit will refactor the rules used by fetch.
refname_match() will be used for matching refspecs in git-send-pack.
Thanks to Daniel Barkalow <barkalow@iabervon.org> for pointing
out that ref_matches_abbrev in remote.c solves a similar problem
and care should be taken to avoid confusion.
Signed-off-by: Steffen Prohaska <prohaska@zib.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2007-11-11 22:01:46 +08:00
|
|
|
{
|
|
|
|
const char **p;
|
|
|
|
const int abbrev_name_len = strlen(abbrev_name);
|
|
|
|
|
2014-01-14 11:16:07 +08:00
|
|
|
for (p = ref_rev_parse_rules; *p; p++) {
|
add refname_match()
We use at least two rulesets for matching abbreviated refnames with
full refnames (starting with 'refs/'). git-rev-parse and git-fetch
use slightly different rules.
This commit introduces a new function refname_match
(const char *abbrev_name, const char *full_name, const char **rules).
abbrev_name is expanded using the rules and matched against full_name.
If a match is found the function returns true. rules is a NULL-terminate
list of format patterns with "%.*s", for example:
const char *ref_rev_parse_rules[] = {
"%.*s",
"refs/%.*s",
"refs/tags/%.*s",
"refs/heads/%.*s",
"refs/remotes/%.*s",
"refs/remotes/%.*s/HEAD",
NULL
};
Asterisks are included in the format strings because this is the form
required in sha1_name.c. Sharing the list with the functions there is
a good idea to avoid duplicating the rules. Hopefully this
facilitates unified matching rules in the future.
This commit makes the rules used by rev-parse for resolving refs to
sha1s available for string comparison. Before this change, the rules
were buried in get_sha1*() and dwim_ref().
A follow-up commit will refactor the rules used by fetch.
refname_match() will be used for matching refspecs in git-send-pack.
Thanks to Daniel Barkalow <barkalow@iabervon.org> for pointing
out that ref_matches_abbrev in remote.c solves a similar problem
and care should be taken to avoid confusion.
Signed-off-by: Steffen Prohaska <prohaska@zib.de>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2007-11-11 22:01:46 +08:00
|
|
|
if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2011-10-13 01:35:38 +08:00
|
|
|
/*
|
|
|
|
* *string and *len will only be substituted, and *string returned (for
|
|
|
|
* later free()ing) if the string passed in is a magic short-hand form
|
|
|
|
* to name a branch.
|
|
|
|
*/
|
|
|
|
static char *substitute_branch_name(const char **string, int *len)
|
|
|
|
{
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
interpret_branch_name: allow callers to restrict expansions
The interpret_branch_name() function converts names like
@{-1} and @{upstream} into branch names. The expanded ref
names are not fully qualified, and may be outside of the
refs/heads/ namespace (e.g., "@" expands to "HEAD", and
"@{upstream}" is likely to be in "refs/remotes/").
This is OK for callers like dwim_ref() which are primarily
interested in resolving the resulting name, no matter where
it is. But callers like "git branch" treat the result as a
branch name in refs/heads/. When we expand to a ref outside
that namespace, the results are very confusing (e.g., "git
branch @" tries to create refs/heads/HEAD, which is
nonsense).
Callers can't know from the returned string how the
expansion happened (e.g., did the user really ask for a
branch named "HEAD", or did we do a bogus expansion?). One
fix would be to return some out-parameters describing the
types of expansion that occurred. This has the benefit that
the caller can generate precise error messages ("I
understood @{upstream} to mean origin/master, but that is a
remote tracking branch, so you cannot create it as a local
name").
However, out-parameters make the function interface somewhat
cumbersome. Instead, let's do the opposite: let the caller
tell us which elements to expand. That's easier to pass in,
and none of the callers give more precise error messages
than "@{upstream} isn't a valid branch name" anyway (which
should be sufficient).
The strbuf_branchname() function needs a similar parameter,
as most of the callers access interpret_branch_name()
through it.
We can break the callers down into two groups:
1. Callers that are happy with any kind of ref in the
result. We pass "0" here, so they continue to work
without restrictions. This includes merge_name(),
the reflog handling in add_pending_object_with_path(),
and substitute_branch_name(). This last is what powers
dwim_ref().
2. Callers that have funny corner cases (mostly in
git-branch and git-checkout). These need to make use of
the new parameter, but I've left them as "0" in this
patch, and will address them individually in follow-on
patches.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-03-02 16:23:01 +08:00
|
|
|
int ret = interpret_branch_name(*string, *len, &buf, 0);
|
2011-10-13 01:35:38 +08:00
|
|
|
|
|
|
|
if (ret == *len) {
|
|
|
|
size_t size;
|
|
|
|
*string = strbuf_detach(&buf, &size);
|
|
|
|
*len = size;
|
|
|
|
return (char *)*string;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)
|
|
|
|
{
|
|
|
|
char *last_branch = substitute_branch_name(&str, &len);
|
2016-06-12 18:54:02 +08:00
|
|
|
int refs_found = expand_ref(str, len, sha1, ref);
|
|
|
|
free(last_branch);
|
|
|
|
return refs_found;
|
|
|
|
}
|
|
|
|
|
|
|
|
int expand_ref(const char *str, int len, unsigned char *sha1, char **ref)
|
|
|
|
{
|
2011-10-13 01:35:38 +08:00
|
|
|
const char **p, *r;
|
|
|
|
int refs_found = 0;
|
2017-03-29 03:46:33 +08:00
|
|
|
struct strbuf fullref = STRBUF_INIT;
|
2011-10-13 01:35:38 +08:00
|
|
|
|
|
|
|
*ref = NULL;
|
|
|
|
for (p = ref_rev_parse_rules; *p; p++) {
|
|
|
|
unsigned char sha1_from_ref[20];
|
|
|
|
unsigned char *this_result;
|
|
|
|
int flag;
|
|
|
|
|
|
|
|
this_result = refs_found ? sha1_from_ref : sha1;
|
2017-03-29 03:46:33 +08:00
|
|
|
strbuf_reset(&fullref);
|
|
|
|
strbuf_addf(&fullref, *p, len, str);
|
|
|
|
r = resolve_ref_unsafe(fullref.buf, RESOLVE_REF_READING,
|
2014-07-16 03:59:36 +08:00
|
|
|
this_result, &flag);
|
2011-10-13 01:35:38 +08:00
|
|
|
if (r) {
|
|
|
|
if (!refs_found++)
|
|
|
|
*ref = xstrdup(r);
|
|
|
|
if (!warn_ambiguous_refs)
|
|
|
|
break;
|
2017-03-29 03:46:33 +08:00
|
|
|
} else if ((flag & REF_ISSYMREF) && strcmp(fullref.buf, "HEAD")) {
|
|
|
|
warning("ignoring dangling symref %s.", fullref.buf);
|
|
|
|
} else if ((flag & REF_ISBROKEN) && strchr(fullref.buf, '/')) {
|
|
|
|
warning("ignoring broken ref %s.", fullref.buf);
|
2011-10-20 04:55:49 +08:00
|
|
|
}
|
2011-10-13 01:35:38 +08:00
|
|
|
}
|
2017-03-29 03:46:33 +08:00
|
|
|
strbuf_release(&fullref);
|
2011-10-13 01:35:38 +08:00
|
|
|
return refs_found;
|
|
|
|
}
|
|
|
|
|
|
|
|
int dwim_log(const char *str, int len, unsigned char *sha1, char **log)
|
|
|
|
{
|
|
|
|
char *last_branch = substitute_branch_name(&str, &len);
|
|
|
|
const char **p;
|
|
|
|
int logs_found = 0;
|
2017-03-29 03:46:33 +08:00
|
|
|
struct strbuf path = STRBUF_INIT;
|
2011-10-13 01:35:38 +08:00
|
|
|
|
|
|
|
*log = NULL;
|
|
|
|
for (p = ref_rev_parse_rules; *p; p++) {
|
|
|
|
unsigned char hash[20];
|
|
|
|
const char *ref, *it;
|
|
|
|
|
2017-03-29 03:46:33 +08:00
|
|
|
strbuf_reset(&path);
|
|
|
|
strbuf_addf(&path, *p, len, str);
|
|
|
|
ref = resolve_ref_unsafe(path.buf, RESOLVE_REF_READING,
|
2014-07-16 03:59:36 +08:00
|
|
|
hash, NULL);
|
2011-10-13 01:35:38 +08:00
|
|
|
if (!ref)
|
|
|
|
continue;
|
2017-03-29 03:46:33 +08:00
|
|
|
if (reflog_exists(path.buf))
|
|
|
|
it = path.buf;
|
|
|
|
else if (strcmp(ref, path.buf) && reflog_exists(ref))
|
2011-10-13 01:35:38 +08:00
|
|
|
it = ref;
|
|
|
|
else
|
|
|
|
continue;
|
|
|
|
if (!logs_found++) {
|
|
|
|
*log = xstrdup(it);
|
|
|
|
hashcpy(sha1, hash);
|
|
|
|
}
|
2015-11-09 21:34:01 +08:00
|
|
|
if (!warn_ambiguous_refs)
|
|
|
|
break;
|
2006-10-01 06:02:00 +08:00
|
|
|
}
|
2017-03-29 03:46:33 +08:00
|
|
|
strbuf_release(&path);
|
2015-11-09 21:34:01 +08:00
|
|
|
free(last_branch);
|
|
|
|
return logs_found;
|
2013-09-04 23:22:41 +08:00
|
|
|
}
|
|
|
|
|
2015-07-31 14:06:18 +08:00
|
|
|
static int is_per_worktree_ref(const char *refname)
|
|
|
|
{
|
2015-09-01 10:13:11 +08:00
|
|
|
return !strcmp(refname, "HEAD") ||
|
|
|
|
starts_with(refname, "refs/bisect/");
|
2015-07-31 14:06:18 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static int is_pseudoref_syntax(const char *refname)
|
|
|
|
{
|
|
|
|
const char *c;
|
|
|
|
|
|
|
|
for (c = refname; *c; c++) {
|
|
|
|
if (!isupper(*c) && *c != '-' && *c != '_')
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
enum ref_type ref_type(const char *refname)
|
|
|
|
{
|
|
|
|
if (is_per_worktree_ref(refname))
|
|
|
|
return REF_TYPE_PER_WORKTREE;
|
|
|
|
if (is_pseudoref_syntax(refname))
|
|
|
|
return REF_TYPE_PSEUDOREF;
|
|
|
|
return REF_TYPE_NORMAL;
|
|
|
|
}
|
|
|
|
|
2015-07-31 14:06:19 +08:00
|
|
|
static int write_pseudoref(const char *pseudoref, const unsigned char *sha1,
|
|
|
|
const unsigned char *old_sha1, struct strbuf *err)
|
|
|
|
{
|
|
|
|
const char *filename;
|
|
|
|
int fd;
|
|
|
|
static struct lock_file lock;
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
|
|
|
int ret = -1;
|
|
|
|
|
|
|
|
strbuf_addf(&buf, "%s\n", sha1_to_hex(sha1));
|
|
|
|
|
|
|
|
filename = git_path("%s", pseudoref);
|
|
|
|
fd = hold_lock_file_for_update(&lock, filename, LOCK_DIE_ON_ERROR);
|
|
|
|
if (fd < 0) {
|
2016-04-27 21:21:36 +08:00
|
|
|
strbuf_addf(err, "could not open '%s' for writing: %s",
|
2015-07-31 14:06:19 +08:00
|
|
|
filename, strerror(errno));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (old_sha1) {
|
|
|
|
unsigned char actual_old_sha1[20];
|
2015-07-16 06:05:28 +08:00
|
|
|
|
|
|
|
if (read_ref(pseudoref, actual_old_sha1))
|
|
|
|
die("could not read ref '%s'", pseudoref);
|
2015-07-31 14:06:19 +08:00
|
|
|
if (hashcmp(actual_old_sha1, old_sha1)) {
|
2016-04-27 21:21:36 +08:00
|
|
|
strbuf_addf(err, "unexpected sha1 when writing '%s'", pseudoref);
|
2015-07-31 14:06:19 +08:00
|
|
|
rollback_lock_file(&lock);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (write_in_full(fd, buf.buf, buf.len) != buf.len) {
|
2016-04-27 21:21:36 +08:00
|
|
|
strbuf_addf(err, "could not write to '%s'", filename);
|
2015-07-31 14:06:19 +08:00
|
|
|
rollback_lock_file(&lock);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
commit_lock_file(&lock);
|
|
|
|
ret = 0;
|
|
|
|
done:
|
|
|
|
strbuf_release(&buf);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int delete_pseudoref(const char *pseudoref, const unsigned char *old_sha1)
|
|
|
|
{
|
|
|
|
static struct lock_file lock;
|
|
|
|
const char *filename;
|
|
|
|
|
|
|
|
filename = git_path("%s", pseudoref);
|
|
|
|
|
|
|
|
if (old_sha1 && !is_null_sha1(old_sha1)) {
|
|
|
|
int fd;
|
|
|
|
unsigned char actual_old_sha1[20];
|
|
|
|
|
|
|
|
fd = hold_lock_file_for_update(&lock, filename,
|
|
|
|
LOCK_DIE_ON_ERROR);
|
|
|
|
if (fd < 0)
|
|
|
|
die_errno(_("Could not open '%s' for writing"), filename);
|
2015-07-16 06:05:28 +08:00
|
|
|
if (read_ref(pseudoref, actual_old_sha1))
|
|
|
|
die("could not read ref '%s'", pseudoref);
|
2015-07-31 14:06:19 +08:00
|
|
|
if (hashcmp(actual_old_sha1, old_sha1)) {
|
|
|
|
warning("Unexpected sha1 when deleting %s", pseudoref);
|
|
|
|
rollback_lock_file(&lock);
|
|
|
|
return -1;
|
2015-07-22 05:04:50 +08:00
|
|
|
}
|
2015-07-31 14:06:19 +08:00
|
|
|
|
|
|
|
unlink(filename);
|
|
|
|
rollback_lock_file(&lock);
|
|
|
|
} else {
|
|
|
|
unlink(filename);
|
2006-05-17 17:55:02 +08:00
|
|
|
}
|
2015-07-22 05:04:50 +08:00
|
|
|
|
2006-05-17 17:55:02 +08:00
|
|
|
return 0;
|
2005-06-07 04:31:29 +08:00
|
|
|
}
|
2006-05-17 17:56:09 +08:00
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
int refs_delete_ref(struct ref_store *refs, const char *msg,
|
|
|
|
const char *refname,
|
|
|
|
const unsigned char *old_sha1,
|
|
|
|
unsigned int flags)
|
2007-01-27 06:26:09 +08:00
|
|
|
{
|
2014-05-01 00:22:45 +08:00
|
|
|
struct ref_transaction *transaction;
|
2015-07-22 05:04:50 +08:00
|
|
|
struct strbuf err = STRBUF_INIT;
|
2007-01-27 06:26:10 +08:00
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
if (ref_type(refname) == REF_TYPE_PSEUDOREF) {
|
|
|
|
assert(refs == get_main_ref_store());
|
2015-08-26 05:57:08 +08:00
|
|
|
return delete_pseudoref(refname, old_sha1);
|
2017-03-26 10:42:35 +08:00
|
|
|
}
|
2007-02-08 15:41:43 +08:00
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
transaction = ref_store_transaction_begin(refs, &err);
|
2014-05-01 00:22:45 +08:00
|
|
|
if (!transaction ||
|
2015-06-22 22:02:54 +08:00
|
|
|
ref_transaction_delete(transaction, refname, old_sha1,
|
2017-02-21 09:10:32 +08:00
|
|
|
flags, msg, &err) ||
|
2014-05-01 03:22:42 +08:00
|
|
|
ref_transaction_commit(transaction, &err)) {
|
2014-05-01 00:22:45 +08:00
|
|
|
error("%s", err.buf);
|
|
|
|
ref_transaction_free(transaction);
|
|
|
|
strbuf_release(&err);
|
2006-10-01 06:02:00 +08:00
|
|
|
return 1;
|
2007-01-27 06:26:09 +08:00
|
|
|
}
|
2015-11-09 21:34:01 +08:00
|
|
|
ref_transaction_free(transaction);
|
|
|
|
strbuf_release(&err);
|
2008-01-17 03:14:30 +08:00
|
|
|
return 0;
|
|
|
|
}
|
2007-01-27 06:26:09 +08:00
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
int delete_ref(const char *msg, const char *refname,
|
|
|
|
const unsigned char *old_sha1, unsigned int flags)
|
|
|
|
{
|
|
|
|
return refs_delete_ref(get_main_ref_store(), msg, refname,
|
|
|
|
old_sha1, flags);
|
|
|
|
}
|
|
|
|
|
2015-11-10 19:42:36 +08:00
|
|
|
int copy_reflog_msg(char *buf, const char *msg)
|
2007-07-29 08:17:17 +08:00
|
|
|
{
|
|
|
|
char *cp = buf;
|
|
|
|
char c;
|
|
|
|
int wasspace = 1;
|
2007-01-27 06:26:10 +08:00
|
|
|
|
2007-07-29 08:17:17 +08:00
|
|
|
*cp++ = '\t';
|
|
|
|
while ((c = *msg++)) {
|
|
|
|
if (wasspace && isspace(c))
|
|
|
|
continue;
|
|
|
|
wasspace = isspace(c);
|
|
|
|
if (wasspace)
|
|
|
|
c = ' ';
|
|
|
|
*cp++ = c;
|
2015-07-22 05:04:50 +08:00
|
|
|
}
|
2007-07-29 08:17:17 +08:00
|
|
|
while (buf < cp && isspace(cp[-1]))
|
|
|
|
cp--;
|
|
|
|
*cp++ = '\n';
|
|
|
|
return cp - buf;
|
|
|
|
}
|
2007-01-27 06:26:10 +08:00
|
|
|
|
2015-11-10 19:42:36 +08:00
|
|
|
int should_autocreate_reflog(const char *refname)
|
2015-07-22 05:04:51 +08:00
|
|
|
{
|
2017-01-27 18:09:47 +08:00
|
|
|
switch (log_all_ref_updates) {
|
|
|
|
case LOG_REFS_ALWAYS:
|
|
|
|
return 1;
|
|
|
|
case LOG_REFS_NORMAL:
|
|
|
|
return starts_with(refname, "refs/heads/") ||
|
|
|
|
starts_with(refname, "refs/remotes/") ||
|
|
|
|
starts_with(refname, "refs/notes/") ||
|
|
|
|
!strcmp(refname, "HEAD");
|
|
|
|
default:
|
2015-07-22 05:04:51 +08:00
|
|
|
return 0;
|
2017-01-27 18:09:47 +08:00
|
|
|
}
|
2015-07-22 05:04:51 +08:00
|
|
|
}
|
|
|
|
|
2014-07-16 07:02:38 +08:00
|
|
|
int is_branch(const char *refname)
|
2008-01-16 07:50:17 +08:00
|
|
|
{
|
2013-12-01 04:55:40 +08:00
|
|
|
return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");
|
2007-01-27 06:26:09 +08:00
|
|
|
}
|
|
|
|
|
2014-06-04 00:09:59 +08:00
|
|
|
struct read_ref_at_cb {
|
|
|
|
const char *refname;
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t at_time;
|
2014-06-04 00:09:59 +08:00
|
|
|
int cnt;
|
|
|
|
int reccnt;
|
|
|
|
unsigned char *sha1;
|
|
|
|
int found_it;
|
|
|
|
|
|
|
|
unsigned char osha1[20];
|
|
|
|
unsigned char nsha1[20];
|
|
|
|
int tz;
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t date;
|
2014-06-04 00:09:59 +08:00
|
|
|
char **msg;
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t *cutoff_time;
|
2014-06-04 00:09:59 +08:00
|
|
|
int *cutoff_tz;
|
|
|
|
int *cutoff_cnt;
|
|
|
|
};
|
|
|
|
|
2017-02-22 07:47:32 +08:00
|
|
|
static int read_ref_at_ent(struct object_id *ooid, struct object_id *noid,
|
2017-04-27 03:29:31 +08:00
|
|
|
const char *email, timestamp_t timestamp, int tz,
|
2014-06-04 00:09:59 +08:00
|
|
|
const char *message, void *cb_data)
|
|
|
|
{
|
|
|
|
struct read_ref_at_cb *cb = cb_data;
|
|
|
|
|
|
|
|
cb->reccnt++;
|
|
|
|
cb->tz = tz;
|
|
|
|
cb->date = timestamp;
|
|
|
|
|
|
|
|
if (timestamp <= cb->at_time || cb->cnt == 0) {
|
|
|
|
if (cb->msg)
|
|
|
|
*cb->msg = xstrdup(message);
|
|
|
|
if (cb->cutoff_time)
|
|
|
|
*cb->cutoff_time = timestamp;
|
|
|
|
if (cb->cutoff_tz)
|
|
|
|
*cb->cutoff_tz = tz;
|
|
|
|
if (cb->cutoff_cnt)
|
|
|
|
*cb->cutoff_cnt = cb->reccnt - 1;
|
|
|
|
/*
|
|
|
|
* we have not yet updated cb->[n|o]sha1 so they still
|
|
|
|
* hold the values for the previous record.
|
|
|
|
*/
|
|
|
|
if (!is_null_sha1(cb->osha1)) {
|
2017-02-22 07:47:32 +08:00
|
|
|
hashcpy(cb->sha1, noid->hash);
|
|
|
|
if (hashcmp(cb->osha1, noid->hash))
|
2014-06-04 00:09:59 +08:00
|
|
|
warning("Log for ref %s has gap after %s.",
|
convert "enum date_mode" into a struct
In preparation for adding date modes that may carry extra
information beyond the mode itself, this patch converts the
date_mode enum into a struct.
Most of the conversion is fairly straightforward; we pass
the struct as a pointer and dereference the type field where
necessary. Locations that declare a date_mode can use a "{}"
constructor. However, the tricky case is where we use the
enum labels as constants, like:
show_date(t, tz, DATE_NORMAL);
Ideally we could say:
show_date(t, tz, &{ DATE_NORMAL });
but of course C does not allow that. Likewise, we cannot
cast the constant to a struct, because we need to pass an
actual address. Our options are basically:
1. Manually add a "struct date_mode d = { DATE_NORMAL }"
definition to each caller, and pass "&d". This makes
the callers uglier, because they sometimes do not even
have their own scope (e.g., they are inside a switch
statement).
2. Provide a pre-made global "date_normal" struct that can
be passed by address. We'd also need "date_rfc2822",
"date_iso8601", and so forth. But at least the ugliness
is defined in one place.
3. Provide a wrapper that generates the correct struct on
the fly. The big downside is that we end up pointing to
a single global, which makes our wrapper non-reentrant.
But show_date is already not reentrant, so it does not
matter.
This patch implements 3, along with a minor macro to keep
the size of the callers sane.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-06-26 00:55:02 +08:00
|
|
|
cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822)));
|
2014-06-04 00:09:59 +08:00
|
|
|
}
|
|
|
|
else if (cb->date == cb->at_time)
|
2017-02-22 07:47:32 +08:00
|
|
|
hashcpy(cb->sha1, noid->hash);
|
|
|
|
else if (hashcmp(noid->hash, cb->sha1))
|
2014-06-04 00:09:59 +08:00
|
|
|
warning("Log for ref %s unexpectedly ended on %s.",
|
|
|
|
cb->refname, show_date(cb->date, cb->tz,
|
convert "enum date_mode" into a struct
In preparation for adding date modes that may carry extra
information beyond the mode itself, this patch converts the
date_mode enum into a struct.
Most of the conversion is fairly straightforward; we pass
the struct as a pointer and dereference the type field where
necessary. Locations that declare a date_mode can use a "{}"
constructor. However, the tricky case is where we use the
enum labels as constants, like:
show_date(t, tz, DATE_NORMAL);
Ideally we could say:
show_date(t, tz, &{ DATE_NORMAL });
but of course C does not allow that. Likewise, we cannot
cast the constant to a struct, because we need to pass an
actual address. Our options are basically:
1. Manually add a "struct date_mode d = { DATE_NORMAL }"
definition to each caller, and pass "&d". This makes
the callers uglier, because they sometimes do not even
have their own scope (e.g., they are inside a switch
statement).
2. Provide a pre-made global "date_normal" struct that can
be passed by address. We'd also need "date_rfc2822",
"date_iso8601", and so forth. But at least the ugliness
is defined in one place.
3. Provide a wrapper that generates the correct struct on
the fly. The big downside is that we end up pointing to
a single global, which makes our wrapper non-reentrant.
But show_date is already not reentrant, so it does not
matter.
This patch implements 3, along with a minor macro to keep
the size of the callers sane.
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-06-26 00:55:02 +08:00
|
|
|
DATE_MODE(RFC2822)));
|
2017-02-22 07:47:32 +08:00
|
|
|
hashcpy(cb->osha1, ooid->hash);
|
|
|
|
hashcpy(cb->nsha1, noid->hash);
|
2014-06-04 00:09:59 +08:00
|
|
|
cb->found_it = 1;
|
|
|
|
return 1;
|
|
|
|
}
|
2017-02-22 07:47:32 +08:00
|
|
|
hashcpy(cb->osha1, ooid->hash);
|
|
|
|
hashcpy(cb->nsha1, noid->hash);
|
2014-06-04 00:09:59 +08:00
|
|
|
if (cb->cnt > 0)
|
|
|
|
cb->cnt--;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-02-22 07:47:32 +08:00
|
|
|
static int read_ref_at_ent_oldest(struct object_id *ooid, struct object_id *noid,
|
2017-04-27 03:29:31 +08:00
|
|
|
const char *email, timestamp_t timestamp,
|
2014-06-04 00:09:59 +08:00
|
|
|
int tz, const char *message, void *cb_data)
|
|
|
|
{
|
|
|
|
struct read_ref_at_cb *cb = cb_data;
|
|
|
|
|
|
|
|
if (cb->msg)
|
|
|
|
*cb->msg = xstrdup(message);
|
|
|
|
if (cb->cutoff_time)
|
|
|
|
*cb->cutoff_time = timestamp;
|
|
|
|
if (cb->cutoff_tz)
|
|
|
|
*cb->cutoff_tz = tz;
|
|
|
|
if (cb->cutoff_cnt)
|
|
|
|
*cb->cutoff_cnt = cb->reccnt;
|
2017-02-22 07:47:32 +08:00
|
|
|
hashcpy(cb->sha1, ooid->hash);
|
2014-06-04 00:09:59 +08:00
|
|
|
if (is_null_sha1(cb->sha1))
|
2017-02-22 07:47:32 +08:00
|
|
|
hashcpy(cb->sha1, noid->hash);
|
2014-06-04 00:09:59 +08:00
|
|
|
/* We just want the first entry */
|
|
|
|
return 1;
|
2007-01-19 17:19:05 +08:00
|
|
|
}
|
|
|
|
|
2017-04-27 03:29:31 +08:00
|
|
|
int read_ref_at(const char *refname, unsigned int flags, timestamp_t at_time, int cnt,
|
2011-12-12 13:38:09 +08:00
|
|
|
unsigned char *sha1, char **msg,
|
2017-04-27 03:29:31 +08:00
|
|
|
timestamp_t *cutoff_time, int *cutoff_tz, int *cutoff_cnt)
|
2006-05-17 17:56:09 +08:00
|
|
|
{
|
2014-06-04 00:09:59 +08:00
|
|
|
struct read_ref_at_cb cb;
|
2006-05-17 17:56:09 +08:00
|
|
|
|
2014-06-04 00:09:59 +08:00
|
|
|
memset(&cb, 0, sizeof(cb));
|
|
|
|
cb.refname = refname;
|
|
|
|
cb.at_time = at_time;
|
|
|
|
cb.cnt = cnt;
|
|
|
|
cb.msg = msg;
|
|
|
|
cb.cutoff_time = cutoff_time;
|
|
|
|
cb.cutoff_tz = cutoff_tz;
|
|
|
|
cb.cutoff_cnt = cutoff_cnt;
|
|
|
|
cb.sha1 = sha1;
|
|
|
|
|
|
|
|
for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);
|
|
|
|
|
2014-09-19 11:45:37 +08:00
|
|
|
if (!cb.reccnt) {
|
2017-07-14 07:49:29 +08:00
|
|
|
if (flags & GET_OID_QUIETLY)
|
2014-09-19 11:45:37 +08:00
|
|
|
exit(128);
|
|
|
|
else
|
|
|
|
die("Log for %s is empty.", refname);
|
|
|
|
}
|
2014-06-04 00:09:59 +08:00
|
|
|
if (cb.found_it)
|
|
|
|
return 0;
|
|
|
|
|
|
|
|
for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);
|
2006-05-17 17:56:09 +08:00
|
|
|
|
2007-01-19 17:19:05 +08:00
|
|
|
return 1;
|
2006-05-17 17:56:09 +08:00
|
|
|
}
|
2006-12-18 17:18:16 +08:00
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
struct ref_transaction *ref_store_transaction_begin(struct ref_store *refs,
|
|
|
|
struct strbuf *err)
|
2014-04-07 21:48:10 +08:00
|
|
|
{
|
2017-03-26 10:42:35 +08:00
|
|
|
struct ref_transaction *tr;
|
2014-08-29 07:42:37 +08:00
|
|
|
assert(err);
|
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
tr = xcalloc(1, sizeof(struct ref_transaction));
|
|
|
|
tr->ref_store = refs;
|
|
|
|
return tr;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct ref_transaction *ref_transaction_begin(struct strbuf *err)
|
|
|
|
{
|
|
|
|
return ref_store_transaction_begin(get_main_ref_store(), err);
|
2014-04-07 21:48:10 +08:00
|
|
|
}
|
|
|
|
|
2014-06-20 22:42:42 +08:00
|
|
|
void ref_transaction_free(struct ref_transaction *transaction)
|
2014-04-07 21:48:10 +08:00
|
|
|
{
|
2017-05-22 22:17:37 +08:00
|
|
|
size_t i;
|
2014-04-07 21:48:10 +08:00
|
|
|
|
2014-06-20 22:42:45 +08:00
|
|
|
if (!transaction)
|
|
|
|
return;
|
|
|
|
|
ref_transaction_prepare(): new optional step for reference updates
In the future, compound reference stores will sometimes need to modify
references in two different reference stores at the same time, meaning
that a single logical reference transaction might have to be
implemented as two internal sub-transactions. They won't want to call
`ref_transaction_commit()` for the two sub-transactions one after the
other, because that wouldn't be atomic (the first commit could succeed
and the second one fail). Instead, they will want to prepare both
sub-transactions (i.e., obtain any necessary locks and do any
pre-checks), and only if both prepare steps succeed, then commit both
sub-transactions.
Start preparing for that day by adding a new, optional
`ref_transaction_prepare()` step to the reference transaction
sequence, which obtains the locks and does any prechecks, reporting
any errors that occur. Also add a `ref_transaction_abort()` function
that can be used to abort a sub-transaction even if it has already
been prepared.
That is on the side of the public-facing API. On the side of the
`ref_store` VTABLE, get rid of `transaction_commit` and instead add
methods `transaction_prepare`, `transaction_finish`, and
`transaction_abort`. A `ref_transaction_commit()` now basically calls
methods `transaction_prepare` then `transaction_finish`.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-22 22:17:44 +08:00
|
|
|
switch (transaction->state) {
|
|
|
|
case REF_TRANSACTION_OPEN:
|
|
|
|
case REF_TRANSACTION_CLOSED:
|
|
|
|
/* OK */
|
|
|
|
break;
|
|
|
|
case REF_TRANSACTION_PREPARED:
|
|
|
|
die("BUG: free called on a prepared reference transaction");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
die("BUG: unexpected reference transaction state");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2014-05-01 03:22:42 +08:00
|
|
|
for (i = 0; i < transaction->nr; i++) {
|
|
|
|
free(transaction->updates[i]->msg);
|
2014-04-07 21:48:14 +08:00
|
|
|
free(transaction->updates[i]);
|
2014-05-01 03:22:42 +08:00
|
|
|
}
|
2014-04-07 21:48:10 +08:00
|
|
|
free(transaction->updates);
|
|
|
|
free(transaction);
|
|
|
|
}
|
|
|
|
|
2016-04-25 17:39:54 +08:00
|
|
|
struct ref_update *ref_transaction_add_update(
|
|
|
|
struct ref_transaction *transaction,
|
|
|
|
const char *refname, unsigned int flags,
|
|
|
|
const unsigned char *new_sha1,
|
|
|
|
const unsigned char *old_sha1,
|
|
|
|
const char *msg)
|
2014-04-07 21:48:10 +08:00
|
|
|
{
|
2016-02-23 06:44:32 +08:00
|
|
|
struct ref_update *update;
|
2016-04-25 17:39:54 +08:00
|
|
|
|
|
|
|
if (transaction->state != REF_TRANSACTION_OPEN)
|
|
|
|
die("BUG: update called for transaction that is not open");
|
|
|
|
|
|
|
|
if ((flags & REF_ISPRUNING) && !(flags & REF_NODEREF))
|
|
|
|
die("BUG: REF_ISPRUNING set without REF_NODEREF");
|
|
|
|
|
2016-02-23 06:44:32 +08:00
|
|
|
FLEX_ALLOC_STR(update, refname, refname);
|
2014-04-07 21:48:10 +08:00
|
|
|
ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);
|
|
|
|
transaction->updates[transaction->nr++] = update;
|
2016-04-25 17:39:54 +08:00
|
|
|
|
|
|
|
update->flags = flags;
|
|
|
|
|
|
|
|
if (flags & REF_HAVE_NEW)
|
2017-05-07 06:10:23 +08:00
|
|
|
hashcpy(update->new_oid.hash, new_sha1);
|
2016-04-25 17:39:54 +08:00
|
|
|
if (flags & REF_HAVE_OLD)
|
2017-05-07 06:10:23 +08:00
|
|
|
hashcpy(update->old_oid.hash, old_sha1);
|
2016-10-13 02:20:23 +08:00
|
|
|
update->msg = xstrdup_or_null(msg);
|
2014-04-07 21:48:10 +08:00
|
|
|
return update;
|
|
|
|
}
|
|
|
|
|
2014-06-20 22:43:00 +08:00
|
|
|
int ref_transaction_update(struct ref_transaction *transaction,
|
|
|
|
const char *refname,
|
|
|
|
const unsigned char *new_sha1,
|
|
|
|
const unsigned char *old_sha1,
|
2015-02-18 01:00:15 +08:00
|
|
|
unsigned int flags, const char *msg,
|
2014-06-20 22:43:00 +08:00
|
|
|
struct strbuf *err)
|
2014-04-07 21:48:10 +08:00
|
|
|
{
|
2014-08-29 07:42:37 +08:00
|
|
|
assert(err);
|
|
|
|
|
2016-04-27 21:54:45 +08:00
|
|
|
if ((new_sha1 && !is_null_sha1(new_sha1)) ?
|
|
|
|
check_refname_format(refname, REFNAME_ALLOW_ONELEVEL) :
|
|
|
|
!refname_is_safe(refname)) {
|
2016-04-27 21:21:36 +08:00
|
|
|
strbuf_addf(err, "refusing to update ref with bad name '%s'",
|
refs.c: allow listing and deleting badly named refs
We currently do not handle badly named refs well:
$ cp .git/refs/heads/master .git/refs/heads/master.....@\*@\\.
$ git branch
fatal: Reference has invalid format: 'refs/heads/master.....@*@\.'
$ git branch -D master.....@\*@\\.
error: branch 'master.....@*@\.' not found.
Users cannot recover from a badly named ref without manually finding
and deleting the loose ref file or appropriate line in packed-refs.
Making that easier will make it easier to tweak the ref naming rules
in the future, for example to forbid shell metacharacters like '`'
and '"', without putting people in a state that is hard to get out of.
So allow "branch --list" to show these refs and allow "branch -d/-D"
and "update-ref -d" to delete them. Other commands (for example to
rename refs) will continue to not handle these refs but can be changed
in later patches.
Details:
In resolving functions, refuse to resolve refs that don't pass the
git-check-ref-format(1) check unless the new RESOLVE_REF_ALLOW_BAD_NAME
flag is passed. Even with RESOLVE_REF_ALLOW_BAD_NAME, refuse to
resolve refs that escape the refs/ directory and do not match the
pattern [A-Z_]* (think "HEAD" and "MERGE_HEAD").
In locking functions, refuse to act on badly named refs unless they
are being deleted and either are in the refs/ directory or match [A-Z_]*.
Just like other invalid refs, flag resolved, badly named refs with the
REF_ISBROKEN flag, treat them as resolving to null_sha1, and skip them
in all iteration functions except for for_each_rawref.
Flag badly named refs (but not symrefs pointing to badly named refs)
with a REF_BAD_NAME flag to make it easier for future callers to
notice and handle them specially. For example, in a later patch
for-each-ref will use this flag to detect refs whose names can confuse
callers parsing for-each-ref output.
In the transaction API, refuse to create or update badly named refs,
but allow deleting them (unless they try to escape refs/ and don't match
[A-Z_]*).
Signed-off-by: Ronnie Sahlberg <sahlberg@google.com>
Signed-off-by: Jonathan Nieder <jrnieder@gmail.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2014-09-04 02:45:43 +08:00
|
|
|
refname);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2016-04-25 17:39:54 +08:00
|
|
|
flags |= (new_sha1 ? REF_HAVE_NEW : 0) | (old_sha1 ? REF_HAVE_OLD : 0);
|
|
|
|
|
|
|
|
ref_transaction_add_update(transaction, refname, flags,
|
|
|
|
new_sha1, old_sha1, msg);
|
2014-06-20 22:43:00 +08:00
|
|
|
return 0;
|
2014-04-07 21:48:10 +08:00
|
|
|
}
|
|
|
|
|
2014-04-17 06:26:44 +08:00
|
|
|
int ref_transaction_create(struct ref_transaction *transaction,
|
|
|
|
const char *refname,
|
|
|
|
const unsigned char *new_sha1,
|
2015-02-18 01:00:13 +08:00
|
|
|
unsigned int flags, const char *msg,
|
2014-04-17 06:26:44 +08:00
|
|
|
struct strbuf *err)
|
2014-04-07 21:48:10 +08:00
|
|
|
{
|
2015-02-18 01:00:19 +08:00
|
|
|
if (!new_sha1 || is_null_sha1(new_sha1))
|
|
|
|
die("BUG: create called without valid new_sha1");
|
2014-12-05 07:08:13 +08:00
|
|
|
return ref_transaction_update(transaction, refname, new_sha1,
|
2015-02-18 01:00:15 +08:00
|
|
|
null_sha1, flags, msg, err);
|
2014-04-07 21:48:10 +08:00
|
|
|
}
|
|
|
|
|
2014-04-17 06:27:45 +08:00
|
|
|
int ref_transaction_delete(struct ref_transaction *transaction,
|
|
|
|
const char *refname,
|
|
|
|
const unsigned char *old_sha1,
|
2015-02-18 01:00:16 +08:00
|
|
|
unsigned int flags, const char *msg,
|
2014-04-17 06:27:45 +08:00
|
|
|
struct strbuf *err)
|
2014-04-07 21:48:10 +08:00
|
|
|
{
|
2015-02-18 01:00:20 +08:00
|
|
|
if (old_sha1 && is_null_sha1(old_sha1))
|
|
|
|
die("BUG: delete called with old_sha1 set to zeros");
|
2015-02-18 01:00:15 +08:00
|
|
|
return ref_transaction_update(transaction, refname,
|
2015-02-18 01:00:16 +08:00
|
|
|
null_sha1, old_sha1,
|
2015-02-18 01:00:15 +08:00
|
|
|
flags, msg, err);
|
2014-04-07 21:48:10 +08:00
|
|
|
}
|
|
|
|
|
2015-02-18 01:00:21 +08:00
|
|
|
int ref_transaction_verify(struct ref_transaction *transaction,
|
|
|
|
const char *refname,
|
|
|
|
const unsigned char *old_sha1,
|
|
|
|
unsigned int flags,
|
|
|
|
struct strbuf *err)
|
|
|
|
{
|
|
|
|
if (!old_sha1)
|
|
|
|
die("BUG: verify called with old_sha1 set to NULL");
|
|
|
|
return ref_transaction_update(transaction, refname,
|
|
|
|
NULL, old_sha1,
|
|
|
|
flags, NULL, err);
|
|
|
|
}
|
|
|
|
|
2016-09-06 04:08:08 +08:00
|
|
|
int update_ref_oid(const char *msg, const char *refname,
|
|
|
|
const struct object_id *new_oid, const struct object_id *old_oid,
|
|
|
|
unsigned int flags, enum action_on_err onerr)
|
|
|
|
{
|
|
|
|
return update_ref(msg, refname, new_oid ? new_oid->hash : NULL,
|
|
|
|
old_oid ? old_oid->hash : NULL, flags, onerr);
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
int refs_update_ref(struct ref_store *refs, const char *msg,
|
|
|
|
const char *refname, const unsigned char *new_sha1,
|
|
|
|
const unsigned char *old_sha1, unsigned int flags,
|
|
|
|
enum action_on_err onerr)
|
2013-09-04 23:22:40 +08:00
|
|
|
{
|
2015-07-31 14:06:19 +08:00
|
|
|
struct ref_transaction *t = NULL;
|
2014-04-25 07:36:55 +08:00
|
|
|
struct strbuf err = STRBUF_INIT;
|
2015-07-31 14:06:19 +08:00
|
|
|
int ret = 0;
|
2014-04-25 07:36:55 +08:00
|
|
|
|
2015-07-31 14:06:19 +08:00
|
|
|
if (ref_type(refname) == REF_TYPE_PSEUDOREF) {
|
2017-03-26 10:42:35 +08:00
|
|
|
assert(refs == get_main_ref_store());
|
2015-07-31 14:06:19 +08:00
|
|
|
ret = write_pseudoref(refname, new_sha1, old_sha1, &err);
|
|
|
|
} else {
|
2017-03-26 10:42:35 +08:00
|
|
|
t = ref_store_transaction_begin(refs, &err);
|
2015-07-31 14:06:19 +08:00
|
|
|
if (!t ||
|
|
|
|
ref_transaction_update(t, refname, new_sha1, old_sha1,
|
|
|
|
flags, msg, &err) ||
|
|
|
|
ref_transaction_commit(t, &err)) {
|
|
|
|
ret = 1;
|
|
|
|
ref_transaction_free(t);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (ret) {
|
2014-04-25 07:36:55 +08:00
|
|
|
const char *str = "update_ref failed for ref '%s': %s";
|
|
|
|
|
|
|
|
switch (onerr) {
|
|
|
|
case UPDATE_REFS_MSG_ON_ERR:
|
|
|
|
error(str, refname, err.buf);
|
|
|
|
break;
|
|
|
|
case UPDATE_REFS_DIE_ON_ERR:
|
|
|
|
die(str, refname, err.buf);
|
|
|
|
break;
|
|
|
|
case UPDATE_REFS_QUIET_ON_ERR:
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
strbuf_release(&err);
|
2013-09-04 23:22:40 +08:00
|
|
|
return 1;
|
2014-04-25 07:36:55 +08:00
|
|
|
}
|
|
|
|
strbuf_release(&err);
|
2015-07-31 14:06:19 +08:00
|
|
|
if (t)
|
|
|
|
ref_transaction_free(t);
|
2014-04-25 07:36:55 +08:00
|
|
|
return 0;
|
2013-09-04 23:22:40 +08:00
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:35 +08:00
|
|
|
int update_ref(const char *msg, const char *refname,
|
|
|
|
const unsigned char *new_sha1,
|
|
|
|
const unsigned char *old_sha1,
|
|
|
|
unsigned int flags, enum action_on_err onerr)
|
|
|
|
{
|
|
|
|
return refs_update_ref(get_main_ref_store(), msg, refname, new_sha1,
|
|
|
|
old_sha1, flags, onerr);
|
|
|
|
}
|
|
|
|
|
2011-12-12 13:38:09 +08:00
|
|
|
char *shorten_unambiguous_ref(const char *refname, int strict)
|
2009-04-07 15:14:20 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
static char **scanf_fmts;
|
|
|
|
static int nr_rules;
|
|
|
|
char *short_name;
|
2017-03-29 03:46:33 +08:00
|
|
|
struct strbuf resolved_buf = STRBUF_INIT;
|
2009-04-07 15:14:20 +08:00
|
|
|
|
|
|
|
if (!nr_rules) {
|
2014-01-08 22:43:39 +08:00
|
|
|
/*
|
|
|
|
* Pre-generate scanf formats from ref_rev_parse_rules[].
|
|
|
|
* Generate a format suitable for scanf from a
|
|
|
|
* ref_rev_parse_rules rule by interpolating "%s" at the
|
|
|
|
* location of the "%.*s".
|
|
|
|
*/
|
2009-04-07 15:14:20 +08:00
|
|
|
size_t total_len = 0;
|
2014-01-08 22:43:38 +08:00
|
|
|
size_t offset = 0;
|
2009-04-07 15:14:20 +08:00
|
|
|
|
|
|
|
/* the rule list is NULL terminated, count them first */
|
2013-10-24 16:45:13 +08:00
|
|
|
for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)
|
2014-01-08 22:43:40 +08:00
|
|
|
/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */
|
|
|
|
total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;
|
2009-04-07 15:14:20 +08:00
|
|
|
|
2016-07-31 02:18:31 +08:00
|
|
|
scanf_fmts = xmalloc(st_add(st_mult(sizeof(char *), nr_rules), total_len));
|
2009-04-07 15:14:20 +08:00
|
|
|
|
2014-01-08 22:43:38 +08:00
|
|
|
offset = 0;
|
2009-04-07 15:14:20 +08:00
|
|
|
for (i = 0; i < nr_rules; i++) {
|
2014-01-08 22:43:39 +08:00
|
|
|
assert(offset < total_len);
|
2014-01-08 22:43:38 +08:00
|
|
|
scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;
|
2014-01-08 22:43:39 +08:00
|
|
|
offset += snprintf(scanf_fmts[i], total_len - offset,
|
|
|
|
ref_rev_parse_rules[i], 2, "%s") + 1;
|
2009-04-07 15:14:20 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* bail out if there are no rules */
|
|
|
|
if (!nr_rules)
|
2011-12-12 13:38:09 +08:00
|
|
|
return xstrdup(refname);
|
2009-04-07 15:14:20 +08:00
|
|
|
|
2011-12-12 13:38:09 +08:00
|
|
|
/* buffer for scanf result, at most refname must fit */
|
|
|
|
short_name = xstrdup(refname);
|
2009-04-07 15:14:20 +08:00
|
|
|
|
|
|
|
/* skip first rule, it will always match */
|
|
|
|
for (i = nr_rules - 1; i > 0 ; --i) {
|
|
|
|
int j;
|
2009-04-13 18:25:46 +08:00
|
|
|
int rules_to_fail = i;
|
2009-04-07 15:14:20 +08:00
|
|
|
int short_name_len;
|
|
|
|
|
2011-12-12 13:38:09 +08:00
|
|
|
if (1 != sscanf(refname, scanf_fmts[i], short_name))
|
2009-04-07 15:14:20 +08:00
|
|
|
continue;
|
|
|
|
|
|
|
|
short_name_len = strlen(short_name);
|
|
|
|
|
2009-04-13 18:25:46 +08:00
|
|
|
/*
|
|
|
|
* in strict mode, all (except the matched one) rules
|
|
|
|
* must fail to resolve to a valid non-ambiguous ref
|
|
|
|
*/
|
|
|
|
if (strict)
|
|
|
|
rules_to_fail = nr_rules;
|
|
|
|
|
2009-04-07 15:14:20 +08:00
|
|
|
/*
|
|
|
|
* check if the short name resolves to a valid ref,
|
|
|
|
* but use only rules prior to the matched one
|
|
|
|
*/
|
2009-04-13 18:25:46 +08:00
|
|
|
for (j = 0; j < rules_to_fail; j++) {
|
2009-04-07 15:14:20 +08:00
|
|
|
const char *rule = ref_rev_parse_rules[j];
|
|
|
|
|
2009-04-13 18:25:46 +08:00
|
|
|
/* skip matched rule */
|
|
|
|
if (i == j)
|
|
|
|
continue;
|
|
|
|
|
2009-04-07 15:14:20 +08:00
|
|
|
/*
|
|
|
|
* the short name is ambiguous, if it resolves
|
|
|
|
* (with this previous rule) to a valid ref
|
|
|
|
* read_ref() returns 0 on success
|
|
|
|
*/
|
2017-03-29 03:46:33 +08:00
|
|
|
strbuf_reset(&resolved_buf);
|
|
|
|
strbuf_addf(&resolved_buf, rule,
|
|
|
|
short_name_len, short_name);
|
|
|
|
if (ref_exists(resolved_buf.buf))
|
2009-04-07 15:14:20 +08:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* short name is non-ambiguous if all previous rules
|
|
|
|
* haven't resolved to a valid ref
|
|
|
|
*/
|
2017-03-29 03:46:33 +08:00
|
|
|
if (j == rules_to_fail) {
|
|
|
|
strbuf_release(&resolved_buf);
|
2009-04-07 15:14:20 +08:00
|
|
|
return short_name;
|
2017-03-29 03:46:33 +08:00
|
|
|
}
|
2009-04-07 15:14:20 +08:00
|
|
|
}
|
|
|
|
|
2017-03-29 03:46:33 +08:00
|
|
|
strbuf_release(&resolved_buf);
|
2009-04-07 15:14:20 +08:00
|
|
|
free(short_name);
|
2011-12-12 13:38:09 +08:00
|
|
|
return xstrdup(refname);
|
2009-04-07 15:14:20 +08:00
|
|
|
}
|
upload/receive-pack: allow hiding ref hierarchies
A repository may have refs that are only used for its internal
bookkeeping purposes that should not be exposed to the others that
come over the network.
Teach upload-pack to omit some refs from its initial advertisement
by paying attention to the uploadpack.hiderefs multi-valued
configuration variable. Do the same to receive-pack via the
receive.hiderefs variable. As a convenient short-hand, allow using
transfer.hiderefs to set the value to both of these variables.
Any ref that is under the hierarchies listed on the value of these
variable is excluded from responses to requests made by "ls-remote",
"fetch", etc. (for upload-pack) and "push" (for receive-pack).
Because these hidden refs do not count as OUR_REF, an attempt to
fetch objects at the tip of them will be rejected, and because these
refs do not get advertised, "git push :" will not see local branches
that have the same name as them as "matching" ones to be sent.
An attempt to update/delete these hidden refs with an explicit
refspec, e.g. "git push origin :refs/hidden/22", is rejected. This
is not a new restriction. To the pusher, it would appear that there
is no such ref, so its push request will conclude with "Now that I
sent you all the data, it is time for you to update the refs. I saw
that the ref did not exist when I started pushing, and I want the
result to point at this commit". The receiving end will apply the
compare-and-swap rule to this request and rejects the push with
"Well, your update request conflicts with somebody else; I see there
is such a ref.", which is the right thing to do. Otherwise a push to
a hidden ref will always be "the last one wins", which is not a good
default.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-01-19 08:08:30 +08:00
|
|
|
|
|
|
|
static struct string_list *hide_refs;
|
|
|
|
|
|
|
|
int parse_hide_refs_config(const char *var, const char *value, const char *section)
|
|
|
|
{
|
2017-02-25 05:08:16 +08:00
|
|
|
const char *key;
|
upload/receive-pack: allow hiding ref hierarchies
A repository may have refs that are only used for its internal
bookkeeping purposes that should not be exposed to the others that
come over the network.
Teach upload-pack to omit some refs from its initial advertisement
by paying attention to the uploadpack.hiderefs multi-valued
configuration variable. Do the same to receive-pack via the
receive.hiderefs variable. As a convenient short-hand, allow using
transfer.hiderefs to set the value to both of these variables.
Any ref that is under the hierarchies listed on the value of these
variable is excluded from responses to requests made by "ls-remote",
"fetch", etc. (for upload-pack) and "push" (for receive-pack).
Because these hidden refs do not count as OUR_REF, an attempt to
fetch objects at the tip of them will be rejected, and because these
refs do not get advertised, "git push :" will not see local branches
that have the same name as them as "matching" ones to be sent.
An attempt to update/delete these hidden refs with an explicit
refspec, e.g. "git push origin :refs/hidden/22", is rejected. This
is not a new restriction. To the pusher, it would appear that there
is no such ref, so its push request will conclude with "Now that I
sent you all the data, it is time for you to update the refs. I saw
that the ref did not exist when I started pushing, and I want the
result to point at this commit". The receiving end will apply the
compare-and-swap rule to this request and rejects the push with
"Well, your update request conflicts with somebody else; I see there
is such a ref.", which is the right thing to do. Otherwise a push to
a hidden ref will always be "the last one wins", which is not a good
default.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-01-19 08:08:30 +08:00
|
|
|
if (!strcmp("transfer.hiderefs", var) ||
|
2017-02-25 05:08:16 +08:00
|
|
|
(!parse_config_key(var, section, NULL, NULL, &key) &&
|
|
|
|
!strcmp(key, "hiderefs"))) {
|
upload/receive-pack: allow hiding ref hierarchies
A repository may have refs that are only used for its internal
bookkeeping purposes that should not be exposed to the others that
come over the network.
Teach upload-pack to omit some refs from its initial advertisement
by paying attention to the uploadpack.hiderefs multi-valued
configuration variable. Do the same to receive-pack via the
receive.hiderefs variable. As a convenient short-hand, allow using
transfer.hiderefs to set the value to both of these variables.
Any ref that is under the hierarchies listed on the value of these
variable is excluded from responses to requests made by "ls-remote",
"fetch", etc. (for upload-pack) and "push" (for receive-pack).
Because these hidden refs do not count as OUR_REF, an attempt to
fetch objects at the tip of them will be rejected, and because these
refs do not get advertised, "git push :" will not see local branches
that have the same name as them as "matching" ones to be sent.
An attempt to update/delete these hidden refs with an explicit
refspec, e.g. "git push origin :refs/hidden/22", is rejected. This
is not a new restriction. To the pusher, it would appear that there
is no such ref, so its push request will conclude with "Now that I
sent you all the data, it is time for you to update the refs. I saw
that the ref did not exist when I started pushing, and I want the
result to point at this commit". The receiving end will apply the
compare-and-swap rule to this request and rejects the push with
"Well, your update request conflicts with somebody else; I see there
is such a ref.", which is the right thing to do. Otherwise a push to
a hidden ref will always be "the last one wins", which is not a good
default.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-01-19 08:08:30 +08:00
|
|
|
char *ref;
|
|
|
|
int len;
|
|
|
|
|
|
|
|
if (!value)
|
|
|
|
return config_error_nonbool(var);
|
|
|
|
ref = xstrdup(value);
|
|
|
|
len = strlen(ref);
|
|
|
|
while (len && ref[len - 1] == '/')
|
|
|
|
ref[--len] = '\0';
|
|
|
|
if (!hide_refs) {
|
|
|
|
hide_refs = xcalloc(1, sizeof(*hide_refs));
|
|
|
|
hide_refs->strdup_strings = 1;
|
|
|
|
}
|
|
|
|
string_list_append(hide_refs, ref);
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2015-11-03 15:58:16 +08:00
|
|
|
int ref_is_hidden(const char *refname, const char *refname_full)
|
upload/receive-pack: allow hiding ref hierarchies
A repository may have refs that are only used for its internal
bookkeeping purposes that should not be exposed to the others that
come over the network.
Teach upload-pack to omit some refs from its initial advertisement
by paying attention to the uploadpack.hiderefs multi-valued
configuration variable. Do the same to receive-pack via the
receive.hiderefs variable. As a convenient short-hand, allow using
transfer.hiderefs to set the value to both of these variables.
Any ref that is under the hierarchies listed on the value of these
variable is excluded from responses to requests made by "ls-remote",
"fetch", etc. (for upload-pack) and "push" (for receive-pack).
Because these hidden refs do not count as OUR_REF, an attempt to
fetch objects at the tip of them will be rejected, and because these
refs do not get advertised, "git push :" will not see local branches
that have the same name as them as "matching" ones to be sent.
An attempt to update/delete these hidden refs with an explicit
refspec, e.g. "git push origin :refs/hidden/22", is rejected. This
is not a new restriction. To the pusher, it would appear that there
is no such ref, so its push request will conclude with "Now that I
sent you all the data, it is time for you to update the refs. I saw
that the ref did not exist when I started pushing, and I want the
result to point at this commit". The receiving end will apply the
compare-and-swap rule to this request and rejects the push with
"Well, your update request conflicts with somebody else; I see there
is such a ref.", which is the right thing to do. Otherwise a push to
a hidden ref will always be "the last one wins", which is not a good
default.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-01-19 08:08:30 +08:00
|
|
|
{
|
refs: support negative transfer.hideRefs
If you hide a hierarchy of refs using the transfer.hideRefs
config, there is no way to later override that config to
"unhide" it. This patch implements a "negative" hide which
causes matches to immediately be marked as unhidden, even if
another match would hide it. We take care to apply the
matches in reverse-order from how they are fed to us by the
config machinery, as that lets our usual "last one wins"
config precedence work (and entries in .git/config, for
example, will override /etc/gitconfig).
So you can now do:
$ git config --system transfer.hideRefs refs/secret
$ git config transfer.hideRefs '!refs/secret/not-so-secret'
to hide refs/secret in all repos, except for one public bit
in one specific repo. Or you can even do:
$ git clone \
-u "git -c transfer.hiderefs="!refs/foo" upload-pack" \
remote:repo.git
to clone remote:repo.git, overriding any hiding it has
configured.
There are two alternatives that were considered and
rejected:
1. A generic config mechanism for removing an item from a
list. E.g.: (e.g., "[transfer] hideRefs -= refs/foo").
This is nice because it could apply to other
multi-valued config, as well. But it is not nearly as
flexible. There is no way to say:
[transfer]
hideRefs = refs/secret
hideRefs = refs/secret/not-so-secret
Having explicit negative specifications means we can
override previous entries, even if they are not the
same literal string.
2. Adding another variable to override some parts of
hideRefs (e.g., "exposeRefs").
This solves the problem from alternative (1), but it
cannot easily obey the normal config precedence,
because it would use two separate lists. For example:
[transfer]
hideRefs = refs/secret
exposeRefs = refs/secret/not-so-secret
hideRefs = refs/secret/not-so-secret/no-really-its-secret
With two lists, we have to apply the "expose" rules
first, and only then apply the "hide" rules. But that
does not match what the above config intends.
Of course we could internally parse that to a single
list, respecting the ordering, which saves us having to
invent the new "!" syntax. But using a single name
communicates to the user that the ordering _is_
important. And "!" is well-known for negation, and
should not appear at the beginning of a ref (it is
actually valid in a ref-name, but all entries here
should be fully-qualified, starting with "refs/").
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-07-29 04:23:26 +08:00
|
|
|
int i;
|
upload/receive-pack: allow hiding ref hierarchies
A repository may have refs that are only used for its internal
bookkeeping purposes that should not be exposed to the others that
come over the network.
Teach upload-pack to omit some refs from its initial advertisement
by paying attention to the uploadpack.hiderefs multi-valued
configuration variable. Do the same to receive-pack via the
receive.hiderefs variable. As a convenient short-hand, allow using
transfer.hiderefs to set the value to both of these variables.
Any ref that is under the hierarchies listed on the value of these
variable is excluded from responses to requests made by "ls-remote",
"fetch", etc. (for upload-pack) and "push" (for receive-pack).
Because these hidden refs do not count as OUR_REF, an attempt to
fetch objects at the tip of them will be rejected, and because these
refs do not get advertised, "git push :" will not see local branches
that have the same name as them as "matching" ones to be sent.
An attempt to update/delete these hidden refs with an explicit
refspec, e.g. "git push origin :refs/hidden/22", is rejected. This
is not a new restriction. To the pusher, it would appear that there
is no such ref, so its push request will conclude with "Now that I
sent you all the data, it is time for you to update the refs. I saw
that the ref did not exist when I started pushing, and I want the
result to point at this commit". The receiving end will apply the
compare-and-swap rule to this request and rejects the push with
"Well, your update request conflicts with somebody else; I see there
is such a ref.", which is the right thing to do. Otherwise a push to
a hidden ref will always be "the last one wins", which is not a good
default.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-01-19 08:08:30 +08:00
|
|
|
|
|
|
|
if (!hide_refs)
|
|
|
|
return 0;
|
refs: support negative transfer.hideRefs
If you hide a hierarchy of refs using the transfer.hideRefs
config, there is no way to later override that config to
"unhide" it. This patch implements a "negative" hide which
causes matches to immediately be marked as unhidden, even if
another match would hide it. We take care to apply the
matches in reverse-order from how they are fed to us by the
config machinery, as that lets our usual "last one wins"
config precedence work (and entries in .git/config, for
example, will override /etc/gitconfig).
So you can now do:
$ git config --system transfer.hideRefs refs/secret
$ git config transfer.hideRefs '!refs/secret/not-so-secret'
to hide refs/secret in all repos, except for one public bit
in one specific repo. Or you can even do:
$ git clone \
-u "git -c transfer.hiderefs="!refs/foo" upload-pack" \
remote:repo.git
to clone remote:repo.git, overriding any hiding it has
configured.
There are two alternatives that were considered and
rejected:
1. A generic config mechanism for removing an item from a
list. E.g.: (e.g., "[transfer] hideRefs -= refs/foo").
This is nice because it could apply to other
multi-valued config, as well. But it is not nearly as
flexible. There is no way to say:
[transfer]
hideRefs = refs/secret
hideRefs = refs/secret/not-so-secret
Having explicit negative specifications means we can
override previous entries, even if they are not the
same literal string.
2. Adding another variable to override some parts of
hideRefs (e.g., "exposeRefs").
This solves the problem from alternative (1), but it
cannot easily obey the normal config precedence,
because it would use two separate lists. For example:
[transfer]
hideRefs = refs/secret
exposeRefs = refs/secret/not-so-secret
hideRefs = refs/secret/not-so-secret/no-really-its-secret
With two lists, we have to apply the "expose" rules
first, and only then apply the "hide" rules. But that
does not match what the above config intends.
Of course we could internally parse that to a single
list, respecting the ordering, which saves us having to
invent the new "!" syntax. But using a single name
communicates to the user that the ordering _is_
important. And "!" is well-known for negation, and
should not appear at the beginning of a ref (it is
actually valid in a ref-name, but all entries here
should be fully-qualified, starting with "refs/").
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-07-29 04:23:26 +08:00
|
|
|
for (i = hide_refs->nr - 1; i >= 0; i--) {
|
|
|
|
const char *match = hide_refs->items[i].string;
|
2015-11-03 15:58:16 +08:00
|
|
|
const char *subject;
|
refs: support negative transfer.hideRefs
If you hide a hierarchy of refs using the transfer.hideRefs
config, there is no way to later override that config to
"unhide" it. This patch implements a "negative" hide which
causes matches to immediately be marked as unhidden, even if
another match would hide it. We take care to apply the
matches in reverse-order from how they are fed to us by the
config machinery, as that lets our usual "last one wins"
config precedence work (and entries in .git/config, for
example, will override /etc/gitconfig).
So you can now do:
$ git config --system transfer.hideRefs refs/secret
$ git config transfer.hideRefs '!refs/secret/not-so-secret'
to hide refs/secret in all repos, except for one public bit
in one specific repo. Or you can even do:
$ git clone \
-u "git -c transfer.hiderefs="!refs/foo" upload-pack" \
remote:repo.git
to clone remote:repo.git, overriding any hiding it has
configured.
There are two alternatives that were considered and
rejected:
1. A generic config mechanism for removing an item from a
list. E.g.: (e.g., "[transfer] hideRefs -= refs/foo").
This is nice because it could apply to other
multi-valued config, as well. But it is not nearly as
flexible. There is no way to say:
[transfer]
hideRefs = refs/secret
hideRefs = refs/secret/not-so-secret
Having explicit negative specifications means we can
override previous entries, even if they are not the
same literal string.
2. Adding another variable to override some parts of
hideRefs (e.g., "exposeRefs").
This solves the problem from alternative (1), but it
cannot easily obey the normal config precedence,
because it would use two separate lists. For example:
[transfer]
hideRefs = refs/secret
exposeRefs = refs/secret/not-so-secret
hideRefs = refs/secret/not-so-secret/no-really-its-secret
With two lists, we have to apply the "expose" rules
first, and only then apply the "hide" rules. But that
does not match what the above config intends.
Of course we could internally parse that to a single
list, respecting the ordering, which saves us having to
invent the new "!" syntax. But using a single name
communicates to the user that the ordering _is_
important. And "!" is well-known for negation, and
should not appear at the beginning of a ref (it is
actually valid in a ref-name, but all entries here
should be fully-qualified, starting with "refs/").
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-07-29 04:23:26 +08:00
|
|
|
int neg = 0;
|
2017-07-22 12:39:12 +08:00
|
|
|
const char *p;
|
refs: support negative transfer.hideRefs
If you hide a hierarchy of refs using the transfer.hideRefs
config, there is no way to later override that config to
"unhide" it. This patch implements a "negative" hide which
causes matches to immediately be marked as unhidden, even if
another match would hide it. We take care to apply the
matches in reverse-order from how they are fed to us by the
config machinery, as that lets our usual "last one wins"
config precedence work (and entries in .git/config, for
example, will override /etc/gitconfig).
So you can now do:
$ git config --system transfer.hideRefs refs/secret
$ git config transfer.hideRefs '!refs/secret/not-so-secret'
to hide refs/secret in all repos, except for one public bit
in one specific repo. Or you can even do:
$ git clone \
-u "git -c transfer.hiderefs="!refs/foo" upload-pack" \
remote:repo.git
to clone remote:repo.git, overriding any hiding it has
configured.
There are two alternatives that were considered and
rejected:
1. A generic config mechanism for removing an item from a
list. E.g.: (e.g., "[transfer] hideRefs -= refs/foo").
This is nice because it could apply to other
multi-valued config, as well. But it is not nearly as
flexible. There is no way to say:
[transfer]
hideRefs = refs/secret
hideRefs = refs/secret/not-so-secret
Having explicit negative specifications means we can
override previous entries, even if they are not the
same literal string.
2. Adding another variable to override some parts of
hideRefs (e.g., "exposeRefs").
This solves the problem from alternative (1), but it
cannot easily obey the normal config precedence,
because it would use two separate lists. For example:
[transfer]
hideRefs = refs/secret
exposeRefs = refs/secret/not-so-secret
hideRefs = refs/secret/not-so-secret/no-really-its-secret
With two lists, we have to apply the "expose" rules
first, and only then apply the "hide" rules. But that
does not match what the above config intends.
Of course we could internally parse that to a single
list, respecting the ordering, which saves us having to
invent the new "!" syntax. But using a single name
communicates to the user that the ordering _is_
important. And "!" is well-known for negation, and
should not appear at the beginning of a ref (it is
actually valid in a ref-name, but all entries here
should be fully-qualified, starting with "refs/").
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-07-29 04:23:26 +08:00
|
|
|
|
|
|
|
if (*match == '!') {
|
|
|
|
neg = 1;
|
|
|
|
match++;
|
|
|
|
}
|
|
|
|
|
2015-11-03 15:58:16 +08:00
|
|
|
if (*match == '^') {
|
|
|
|
subject = refname_full;
|
|
|
|
match++;
|
|
|
|
} else {
|
|
|
|
subject = refname;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* refname can be NULL when namespaces are used. */
|
2017-07-22 12:39:12 +08:00
|
|
|
if (subject &&
|
|
|
|
skip_prefix(subject, match, &p) &&
|
|
|
|
(!*p || *p == '/'))
|
refs: support negative transfer.hideRefs
If you hide a hierarchy of refs using the transfer.hideRefs
config, there is no way to later override that config to
"unhide" it. This patch implements a "negative" hide which
causes matches to immediately be marked as unhidden, even if
another match would hide it. We take care to apply the
matches in reverse-order from how they are fed to us by the
config machinery, as that lets our usual "last one wins"
config precedence work (and entries in .git/config, for
example, will override /etc/gitconfig).
So you can now do:
$ git config --system transfer.hideRefs refs/secret
$ git config transfer.hideRefs '!refs/secret/not-so-secret'
to hide refs/secret in all repos, except for one public bit
in one specific repo. Or you can even do:
$ git clone \
-u "git -c transfer.hiderefs="!refs/foo" upload-pack" \
remote:repo.git
to clone remote:repo.git, overriding any hiding it has
configured.
There are two alternatives that were considered and
rejected:
1. A generic config mechanism for removing an item from a
list. E.g.: (e.g., "[transfer] hideRefs -= refs/foo").
This is nice because it could apply to other
multi-valued config, as well. But it is not nearly as
flexible. There is no way to say:
[transfer]
hideRefs = refs/secret
hideRefs = refs/secret/not-so-secret
Having explicit negative specifications means we can
override previous entries, even if they are not the
same literal string.
2. Adding another variable to override some parts of
hideRefs (e.g., "exposeRefs").
This solves the problem from alternative (1), but it
cannot easily obey the normal config precedence,
because it would use two separate lists. For example:
[transfer]
hideRefs = refs/secret
exposeRefs = refs/secret/not-so-secret
hideRefs = refs/secret/not-so-secret/no-really-its-secret
With two lists, we have to apply the "expose" rules
first, and only then apply the "hide" rules. But that
does not match what the above config intends.
Of course we could internally parse that to a single
list, respecting the ordering, which saves us having to
invent the new "!" syntax. But using a single name
communicates to the user that the ordering _is_
important. And "!" is well-known for negation, and
should not appear at the beginning of a ref (it is
actually valid in a ref-name, but all entries here
should be fully-qualified, starting with "refs/").
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2015-07-29 04:23:26 +08:00
|
|
|
return !neg;
|
upload/receive-pack: allow hiding ref hierarchies
A repository may have refs that are only used for its internal
bookkeeping purposes that should not be exposed to the others that
come over the network.
Teach upload-pack to omit some refs from its initial advertisement
by paying attention to the uploadpack.hiderefs multi-valued
configuration variable. Do the same to receive-pack via the
receive.hiderefs variable. As a convenient short-hand, allow using
transfer.hiderefs to set the value to both of these variables.
Any ref that is under the hierarchies listed on the value of these
variable is excluded from responses to requests made by "ls-remote",
"fetch", etc. (for upload-pack) and "push" (for receive-pack).
Because these hidden refs do not count as OUR_REF, an attempt to
fetch objects at the tip of them will be rejected, and because these
refs do not get advertised, "git push :" will not see local branches
that have the same name as them as "matching" ones to be sent.
An attempt to update/delete these hidden refs with an explicit
refspec, e.g. "git push origin :refs/hidden/22", is rejected. This
is not a new restriction. To the pusher, it would appear that there
is no such ref, so its push request will conclude with "Now that I
sent you all the data, it is time for you to update the refs. I saw
that the ref did not exist when I started pushing, and I want the
result to point at this commit". The receiving end will apply the
compare-and-swap rule to this request and rejects the push with
"Well, your update request conflicts with somebody else; I see there
is such a ref.", which is the right thing to do. Otherwise a push to
a hidden ref will always be "the last one wins", which is not a good
default.
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2013-01-19 08:08:30 +08:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2014-12-12 16:56:59 +08:00
|
|
|
|
2015-11-10 19:42:40 +08:00
|
|
|
const char *find_descendant_ref(const char *dirname,
|
|
|
|
const struct string_list *extras,
|
|
|
|
const struct string_list *skip)
|
2014-12-12 16:56:59 +08:00
|
|
|
{
|
2015-11-10 19:42:40 +08:00
|
|
|
int pos;
|
2014-12-12 16:56:59 +08:00
|
|
|
|
2015-11-10 19:42:40 +08:00
|
|
|
if (!extras)
|
|
|
|
return NULL;
|
2014-12-12 16:56:59 +08:00
|
|
|
|
|
|
|
/*
|
2015-11-10 19:42:40 +08:00
|
|
|
* Look at the place where dirname would be inserted into
|
|
|
|
* extras. If there is an entry at that position that starts
|
|
|
|
* with dirname (remember, dirname includes the trailing
|
|
|
|
* slash) and is not in skip, then we have a conflict.
|
2014-12-12 16:56:59 +08:00
|
|
|
*/
|
2015-11-10 19:42:40 +08:00
|
|
|
for (pos = string_list_find_insert_index(extras, dirname, 0);
|
|
|
|
pos < extras->nr; pos++) {
|
|
|
|
const char *extra_refname = extras->items[pos].string;
|
2014-12-12 16:56:59 +08:00
|
|
|
|
2015-11-10 19:42:40 +08:00
|
|
|
if (!starts_with(extra_refname, dirname))
|
|
|
|
break;
|
|
|
|
|
|
|
|
if (!skip || !string_list_has_string(skip, extra_refname))
|
|
|
|
return extra_refname;
|
2014-12-12 16:56:59 +08:00
|
|
|
}
|
2015-11-10 19:42:40 +08:00
|
|
|
return NULL;
|
|
|
|
}
|
2014-12-12 16:56:59 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_rename_ref_available(struct ref_store *refs,
|
|
|
|
const char *old_refname,
|
|
|
|
const char *new_refname)
|
2015-11-10 19:42:40 +08:00
|
|
|
{
|
|
|
|
struct string_list skip = STRING_LIST_INIT_NODUP;
|
|
|
|
struct strbuf err = STRBUF_INIT;
|
2016-09-05 00:08:08 +08:00
|
|
|
int ok;
|
2014-12-12 16:56:59 +08:00
|
|
|
|
2016-09-05 00:08:08 +08:00
|
|
|
string_list_insert(&skip, old_refname);
|
2017-03-26 10:42:34 +08:00
|
|
|
ok = !refs_verify_refname_available(refs, new_refname,
|
|
|
|
NULL, &skip, &err);
|
2016-09-05 00:08:08 +08:00
|
|
|
if (!ok)
|
2015-11-10 19:42:40 +08:00
|
|
|
error("%s", err.buf);
|
|
|
|
|
|
|
|
string_list_clear(&skip, 0);
|
|
|
|
strbuf_release(&err);
|
2016-09-05 00:08:08 +08:00
|
|
|
return ok;
|
2014-12-12 16:56:59 +08:00
|
|
|
}
|
2016-04-08 03:02:48 +08:00
|
|
|
|
2017-08-23 20:36:55 +08:00
|
|
|
int refs_head_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
2016-04-08 03:02:48 +08:00
|
|
|
{
|
|
|
|
struct object_id oid;
|
|
|
|
int flag;
|
|
|
|
|
2017-08-23 20:36:55 +08:00
|
|
|
if (!refs_read_ref_full(refs, "HEAD", RESOLVE_REF_READING,
|
|
|
|
oid.hash, &flag))
|
2016-04-08 03:02:48 +08:00
|
|
|
return fn("HEAD", &oid, flag, cb_data);
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-08-23 20:36:55 +08:00
|
|
|
int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
struct ref_store *refs = get_submodule_ref_store(submodule);
|
|
|
|
|
|
|
|
if (!refs)
|
|
|
|
return -1;
|
|
|
|
return refs_head_ref(refs, fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2016-04-08 03:02:48 +08:00
|
|
|
int head_ref(each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
2017-08-23 20:36:55 +08:00
|
|
|
return refs_head_ref(get_main_ref_store(), fn, cb_data);
|
2016-04-08 03:02:48 +08:00
|
|
|
}
|
2016-04-08 03:02:49 +08:00
|
|
|
|
2017-03-21 00:33:08 +08:00
|
|
|
struct ref_iterator *refs_ref_iterator_begin(
|
|
|
|
struct ref_store *refs,
|
|
|
|
const char *prefix, int trim, int flags)
|
|
|
|
{
|
|
|
|
struct ref_iterator *iter;
|
|
|
|
|
2017-05-22 22:17:52 +08:00
|
|
|
if (ref_paranoia < 0)
|
|
|
|
ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);
|
|
|
|
if (ref_paranoia)
|
|
|
|
flags |= DO_FOR_EACH_INCLUDE_BROKEN;
|
|
|
|
|
2017-03-21 00:33:08 +08:00
|
|
|
iter = refs->be->iterator_begin(refs, prefix, flags);
|
2017-05-22 22:17:36 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* `iterator_begin()` already takes care of prefix, but we
|
|
|
|
* might need to do some trimming:
|
|
|
|
*/
|
|
|
|
if (trim)
|
|
|
|
iter = prefix_ref_iterator_begin(iter, "", trim);
|
2017-03-21 00:33:08 +08:00
|
|
|
|
|
|
|
return iter;
|
|
|
|
}
|
|
|
|
|
do_for_each_ref(): reimplement using reference iteration
Use the reference iterator interface to implement do_for_each_ref().
Delete a bunch of code supporting the old for_each_ref() implementation.
And now that do_for_each_ref() is generic code (it is no longer tied to
the files backend), move it to refs.c.
The implementation is via a new function, do_for_each_ref_iterator(),
which takes a reference iterator as argument and calls a callback
function for each of the references in the iterator.
This change requires the current_ref performance hack for peel_ref() to
be implemented via ref_iterator_peel() rather than peel_entry() because
we don't have a ref_entry handy (it is hidden under three layers:
file_ref_iterator, merge_ref_iterator, and cache_ref_iterator). So:
* do_for_each_ref_iterator() records the active iterator in
current_ref_iter while it is running.
* peel_ref() checks whether current_ref_iter is pointing at the
requested reference. If so, it asks the iterator to peel the
reference (which it can do efficiently via its "peel" virtual
function). For extra safety, we do the optimization only if the
refname *addresses* are the same, not only if the refname *strings*
are the same, to forestall possible mixups between refnames that come
from different ref_iterators.
Please note that this optimization of peel_ref() is only available when
iterating via do_for_each_ref_iterator() (including all of the
for_each_ref() functions, which call it indirectly). It would be
complicated to implement a similar optimization when iterating directly
using a reference iterator, because multiple reference iterators can be
in use at the same time, with interleaved calls to
ref_iterator_advance(). (In fact we do exactly that in
merge_ref_iterator.)
But that is not necessary. peel_ref() is only called while iterating
over references. Callers who iterate using the for_each_ref() functions
benefit from the optimization described above. Callers who iterate using
reference iterators directly have access to the ref_iterator, so they
can call ref_iterator_peel() themselves to get an analogous optimization
in a more straightforward manner.
If we rewrite all callers to use the reference iteration API, then we
can remove the current_ref_iter hack permanently.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-06-18 12:15:16 +08:00
|
|
|
/*
|
|
|
|
* Call fn for each reference in the specified submodule for which the
|
|
|
|
* refname begins with prefix. If trim is non-zero, then trim that
|
|
|
|
* many characters off the beginning of each refname before passing
|
|
|
|
* the refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to
|
|
|
|
* include broken references in the iteration. If fn ever returns a
|
|
|
|
* non-zero value, stop the iteration and return that value;
|
|
|
|
* otherwise, return 0.
|
|
|
|
*/
|
2017-03-26 10:42:34 +08:00
|
|
|
static int do_for_each_ref(struct ref_store *refs, const char *prefix,
|
do_for_each_ref(): reimplement using reference iteration
Use the reference iterator interface to implement do_for_each_ref().
Delete a bunch of code supporting the old for_each_ref() implementation.
And now that do_for_each_ref() is generic code (it is no longer tied to
the files backend), move it to refs.c.
The implementation is via a new function, do_for_each_ref_iterator(),
which takes a reference iterator as argument and calls a callback
function for each of the references in the iterator.
This change requires the current_ref performance hack for peel_ref() to
be implemented via ref_iterator_peel() rather than peel_entry() because
we don't have a ref_entry handy (it is hidden under three layers:
file_ref_iterator, merge_ref_iterator, and cache_ref_iterator). So:
* do_for_each_ref_iterator() records the active iterator in
current_ref_iter while it is running.
* peel_ref() checks whether current_ref_iter is pointing at the
requested reference. If so, it asks the iterator to peel the
reference (which it can do efficiently via its "peel" virtual
function). For extra safety, we do the optimization only if the
refname *addresses* are the same, not only if the refname *strings*
are the same, to forestall possible mixups between refnames that come
from different ref_iterators.
Please note that this optimization of peel_ref() is only available when
iterating via do_for_each_ref_iterator() (including all of the
for_each_ref() functions, which call it indirectly). It would be
complicated to implement a similar optimization when iterating directly
using a reference iterator, because multiple reference iterators can be
in use at the same time, with interleaved calls to
ref_iterator_advance(). (In fact we do exactly that in
merge_ref_iterator.)
But that is not necessary. peel_ref() is only called while iterating
over references. Callers who iterate using the for_each_ref() functions
benefit from the optimization described above. Callers who iterate using
reference iterators directly have access to the ref_iterator, so they
can call ref_iterator_peel() themselves to get an analogous optimization
in a more straightforward manner.
If we rewrite all callers to use the reference iteration API, then we
can remove the current_ref_iter hack permanently.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-06-18 12:15:16 +08:00
|
|
|
each_ref_fn fn, int trim, int flags, void *cb_data)
|
|
|
|
{
|
|
|
|
struct ref_iterator *iter;
|
|
|
|
|
2016-09-05 00:08:11 +08:00
|
|
|
if (!refs)
|
|
|
|
return 0;
|
|
|
|
|
2017-03-21 00:33:08 +08:00
|
|
|
iter = refs_ref_iterator_begin(refs, prefix, trim, flags);
|
do_for_each_ref(): reimplement using reference iteration
Use the reference iterator interface to implement do_for_each_ref().
Delete a bunch of code supporting the old for_each_ref() implementation.
And now that do_for_each_ref() is generic code (it is no longer tied to
the files backend), move it to refs.c.
The implementation is via a new function, do_for_each_ref_iterator(),
which takes a reference iterator as argument and calls a callback
function for each of the references in the iterator.
This change requires the current_ref performance hack for peel_ref() to
be implemented via ref_iterator_peel() rather than peel_entry() because
we don't have a ref_entry handy (it is hidden under three layers:
file_ref_iterator, merge_ref_iterator, and cache_ref_iterator). So:
* do_for_each_ref_iterator() records the active iterator in
current_ref_iter while it is running.
* peel_ref() checks whether current_ref_iter is pointing at the
requested reference. If so, it asks the iterator to peel the
reference (which it can do efficiently via its "peel" virtual
function). For extra safety, we do the optimization only if the
refname *addresses* are the same, not only if the refname *strings*
are the same, to forestall possible mixups between refnames that come
from different ref_iterators.
Please note that this optimization of peel_ref() is only available when
iterating via do_for_each_ref_iterator() (including all of the
for_each_ref() functions, which call it indirectly). It would be
complicated to implement a similar optimization when iterating directly
using a reference iterator, because multiple reference iterators can be
in use at the same time, with interleaved calls to
ref_iterator_advance(). (In fact we do exactly that in
merge_ref_iterator.)
But that is not necessary. peel_ref() is only called while iterating
over references. Callers who iterate using the for_each_ref() functions
benefit from the optimization described above. Callers who iterate using
reference iterators directly have access to the ref_iterator, so they
can call ref_iterator_peel() themselves to get an analogous optimization
in a more straightforward manner.
If we rewrite all callers to use the reference iteration API, then we
can remove the current_ref_iter hack permanently.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2016-06-18 12:15:16 +08:00
|
|
|
|
|
|
|
return do_for_each_ref_iterator(iter, fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_for_each_ref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return do_for_each_ref(refs, "", fn, 0, 0, cb_data);
|
|
|
|
}
|
|
|
|
|
2016-04-08 03:02:49 +08:00
|
|
|
int for_each_ref(each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_ref(get_main_ref_store(), fn, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_ref(get_submodule_ref_store(submodule), fn, cb_data);
|
|
|
|
}
|
|
|
|
|
|
|
|
int refs_for_each_ref_in(struct ref_store *refs, const char *prefix,
|
|
|
|
each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return do_for_each_ref(refs, prefix, fn, strlen(prefix), 0, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_ref_in(get_main_ref_store(), prefix, fn, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int for_each_fullref_in(const char *prefix, each_ref_fn fn, void *cb_data, unsigned int broken)
|
|
|
|
{
|
|
|
|
unsigned int flag = 0;
|
|
|
|
|
|
|
|
if (broken)
|
|
|
|
flag = DO_FOR_EACH_INCLUDE_BROKEN;
|
2017-03-26 10:42:34 +08:00
|
|
|
return do_for_each_ref(get_main_ref_store(),
|
|
|
|
prefix, fn, 0, flag, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int for_each_ref_in_submodule(const char *submodule, const char *prefix,
|
2017-03-26 10:42:34 +08:00
|
|
|
each_ref_fn fn, void *cb_data)
|
2016-04-08 03:02:49 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_ref_in(get_submodule_ref_store(submodule),
|
|
|
|
prefix, fn, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
}
|
|
|
|
|
2017-06-18 21:39:41 +08:00
|
|
|
int for_each_fullref_in_submodule(const char *submodule, const char *prefix,
|
|
|
|
each_ref_fn fn, void *cb_data,
|
|
|
|
unsigned int broken)
|
|
|
|
{
|
|
|
|
unsigned int flag = 0;
|
|
|
|
|
|
|
|
if (broken)
|
|
|
|
flag = DO_FOR_EACH_INCLUDE_BROKEN;
|
|
|
|
return do_for_each_ref(get_submodule_ref_store(submodule),
|
|
|
|
prefix, fn, 0, flag, cb_data);
|
|
|
|
}
|
|
|
|
|
2016-04-08 03:02:49 +08:00
|
|
|
int for_each_replace_ref(each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return do_for_each_ref(get_main_ref_store(),
|
|
|
|
git_replace_ref_base, fn,
|
|
|
|
strlen(git_replace_ref_base),
|
|
|
|
0, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
struct strbuf buf = STRBUF_INIT;
|
|
|
|
int ret;
|
|
|
|
strbuf_addf(&buf, "%srefs/", get_git_namespace());
|
2017-03-26 10:42:34 +08:00
|
|
|
ret = do_for_each_ref(get_main_ref_store(),
|
|
|
|
buf.buf, fn, 0, 0, cb_data);
|
2016-04-08 03:02:49 +08:00
|
|
|
strbuf_release(&buf);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_for_each_rawref(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
2016-04-08 03:02:49 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return do_for_each_ref(refs, "", fn, 0,
|
2016-04-08 03:02:49 +08:00
|
|
|
DO_FOR_EACH_INCLUDE_BROKEN, cb_data);
|
|
|
|
}
|
2016-04-08 03:03:10 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int for_each_rawref(each_ref_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return refs_for_each_rawref(get_main_ref_store(), fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2017-03-21 00:33:07 +08:00
|
|
|
int refs_read_raw_ref(struct ref_store *ref_store,
|
|
|
|
const char *refname, unsigned char *sha1,
|
|
|
|
struct strbuf *referent, unsigned int *type)
|
|
|
|
{
|
|
|
|
return ref_store->be->read_raw_ref(ref_store, refname, sha1, referent, type);
|
|
|
|
}
|
|
|
|
|
2016-04-08 03:03:10 +08:00
|
|
|
/* This function needs to return a meaningful errno on failure */
|
2017-03-26 10:42:34 +08:00
|
|
|
const char *refs_resolve_ref_unsafe(struct ref_store *refs,
|
2017-02-10 04:53:52 +08:00
|
|
|
const char *refname,
|
|
|
|
int resolve_flags,
|
|
|
|
unsigned char *sha1, int *flags)
|
2016-04-08 03:03:10 +08:00
|
|
|
{
|
|
|
|
static struct strbuf sb_refname = STRBUF_INIT;
|
|
|
|
int unused_flags;
|
|
|
|
int symref_count;
|
|
|
|
|
|
|
|
if (!flags)
|
|
|
|
flags = &unused_flags;
|
|
|
|
|
|
|
|
*flags = 0;
|
|
|
|
|
|
|
|
if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
|
|
|
|
if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
|
|
|
|
!refname_is_safe(refname)) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* dwim_ref() uses REF_ISBROKEN to distinguish between
|
|
|
|
* missing refs and refs that were present but invalid,
|
|
|
|
* to complain about the latter to stderr.
|
|
|
|
*
|
|
|
|
* We don't know whether the ref exists, so don't set
|
|
|
|
* REF_ISBROKEN yet.
|
|
|
|
*/
|
|
|
|
*flags |= REF_BAD_NAME;
|
|
|
|
}
|
|
|
|
|
|
|
|
for (symref_count = 0; symref_count < SYMREF_MAXDEPTH; symref_count++) {
|
|
|
|
unsigned int read_flags = 0;
|
|
|
|
|
2017-03-21 00:33:07 +08:00
|
|
|
if (refs_read_raw_ref(refs, refname,
|
|
|
|
sha1, &sb_refname, &read_flags)) {
|
2016-04-08 03:03:10 +08:00
|
|
|
*flags |= read_flags;
|
|
|
|
if (errno != ENOENT || (resolve_flags & RESOLVE_REF_READING))
|
|
|
|
return NULL;
|
|
|
|
hashclr(sha1);
|
|
|
|
if (*flags & REF_BAD_NAME)
|
|
|
|
*flags |= REF_ISBROKEN;
|
|
|
|
return refname;
|
|
|
|
}
|
|
|
|
|
|
|
|
*flags |= read_flags;
|
|
|
|
|
|
|
|
if (!(read_flags & REF_ISSYMREF)) {
|
|
|
|
if (*flags & REF_BAD_NAME) {
|
|
|
|
hashclr(sha1);
|
|
|
|
*flags |= REF_ISBROKEN;
|
|
|
|
}
|
|
|
|
return refname;
|
|
|
|
}
|
|
|
|
|
|
|
|
refname = sb_refname.buf;
|
|
|
|
if (resolve_flags & RESOLVE_REF_NO_RECURSE) {
|
|
|
|
hashclr(sha1);
|
|
|
|
return refname;
|
|
|
|
}
|
|
|
|
if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {
|
|
|
|
if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||
|
|
|
|
!refname_is_safe(refname)) {
|
|
|
|
errno = EINVAL;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
*flags |= REF_ISBROKEN | REF_BAD_NAME;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
errno = ELOOP;
|
|
|
|
return NULL;
|
|
|
|
}
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2016-09-05 00:08:41 +08:00
|
|
|
/* backend functions */
|
|
|
|
int refs_init_db(struct strbuf *err)
|
|
|
|
{
|
2017-03-26 10:42:29 +08:00
|
|
|
struct ref_store *refs = get_main_ref_store();
|
2016-09-05 00:08:41 +08:00
|
|
|
|
|
|
|
return refs->be->init_db(refs, err);
|
|
|
|
}
|
|
|
|
|
2016-09-05 00:08:21 +08:00
|
|
|
const char *resolve_ref_unsafe(const char *refname, int resolve_flags,
|
|
|
|
unsigned char *sha1, int *flags)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_resolve_ref_unsafe(get_main_ref_store(), refname,
|
2016-09-05 00:08:21 +08:00
|
|
|
resolve_flags, sha1, flags);
|
|
|
|
}
|
|
|
|
|
2016-09-05 00:08:24 +08:00
|
|
|
int resolve_gitlink_ref(const char *submodule, const char *refname,
|
|
|
|
unsigned char *sha1)
|
2016-09-05 00:08:22 +08:00
|
|
|
{
|
|
|
|
struct ref_store *refs;
|
|
|
|
int flags;
|
|
|
|
|
2017-08-23 20:36:54 +08:00
|
|
|
refs = get_submodule_ref_store(submodule);
|
2016-09-05 00:08:23 +08:00
|
|
|
|
2016-09-05 00:08:22 +08:00
|
|
|
if (!refs)
|
|
|
|
return -1;
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
if (!refs_resolve_ref_unsafe(refs, refname, 0, sha1, &flags) ||
|
2016-09-05 00:08:22 +08:00
|
|
|
is_null_sha1(sha1))
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
struct ref_store_hash_entry
|
2017-02-10 19:16:15 +08:00
|
|
|
{
|
|
|
|
struct hashmap_entry ent; /* must be the first member! */
|
|
|
|
|
|
|
|
struct ref_store *refs;
|
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
/* NUL-terminated identifier of the ref store: */
|
|
|
|
char name[FLEX_ARRAY];
|
2017-02-10 19:16:15 +08:00
|
|
|
};
|
|
|
|
|
2017-07-01 03:14:05 +08:00
|
|
|
static int ref_store_hash_cmp(const void *unused_cmp_data,
|
|
|
|
const void *entry, const void *entry_or_key,
|
2017-02-10 19:16:15 +08:00
|
|
|
const void *keydata)
|
|
|
|
{
|
2017-04-04 18:21:20 +08:00
|
|
|
const struct ref_store_hash_entry *e1 = entry, *e2 = entry_or_key;
|
|
|
|
const char *name = keydata ? keydata : e2->name;
|
2017-02-10 19:16:15 +08:00
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
return strcmp(e1->name, name);
|
2017-02-10 19:16:15 +08:00
|
|
|
}
|
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
static struct ref_store_hash_entry *alloc_ref_store_hash_entry(
|
|
|
|
const char *name, struct ref_store *refs)
|
2017-02-10 19:16:15 +08:00
|
|
|
{
|
2017-04-04 18:21:20 +08:00
|
|
|
struct ref_store_hash_entry *entry;
|
2017-02-10 19:16:15 +08:00
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
FLEX_ALLOC_STR(entry, name, name);
|
|
|
|
hashmap_entry_init(entry, strhash(name));
|
2017-02-10 19:16:15 +08:00
|
|
|
entry->refs = refs;
|
|
|
|
return entry;
|
|
|
|
}
|
|
|
|
|
2016-09-05 00:08:11 +08:00
|
|
|
/* A pointer to the ref_store for the main repository: */
|
|
|
|
static struct ref_store *main_ref_store;
|
|
|
|
|
2017-02-10 19:16:15 +08:00
|
|
|
/* A hashmap of ref_stores, stored by submodule name: */
|
|
|
|
static struct hashmap submodule_ref_stores;
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2017-04-24 18:01:22 +08:00
|
|
|
/* A hashmap of ref_stores, stored by worktree id: */
|
|
|
|
static struct hashmap worktree_ref_stores;
|
|
|
|
|
2017-02-10 19:16:12 +08:00
|
|
|
/*
|
2017-04-04 18:21:20 +08:00
|
|
|
* Look up a ref store by name. If that ref_store hasn't been
|
|
|
|
* registered yet, return NULL.
|
2017-02-10 19:16:12 +08:00
|
|
|
*/
|
2017-04-04 18:21:20 +08:00
|
|
|
static struct ref_store *lookup_ref_store_map(struct hashmap *map,
|
|
|
|
const char *name)
|
2016-09-05 00:08:11 +08:00
|
|
|
{
|
2017-04-04 18:21:20 +08:00
|
|
|
struct ref_store_hash_entry *entry;
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
if (!map->tablesize)
|
2017-02-10 19:16:15 +08:00
|
|
|
/* It's initialized on demand in register_ref_store(). */
|
|
|
|
return NULL;
|
2017-02-10 19:16:11 +08:00
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
entry = hashmap_get_from_hash(map, strhash(name), name);
|
2017-02-10 19:16:15 +08:00
|
|
|
return entry ? entry->refs : NULL;
|
2016-09-05 00:08:11 +08:00
|
|
|
}
|
|
|
|
|
2017-02-10 19:16:12 +08:00
|
|
|
/*
|
|
|
|
* Create, record, and return a ref_store instance for the specified
|
2017-03-26 10:42:31 +08:00
|
|
|
* gitdir.
|
2017-02-10 19:16:12 +08:00
|
|
|
*/
|
2017-03-26 10:42:32 +08:00
|
|
|
static struct ref_store *ref_store_init(const char *gitdir,
|
|
|
|
unsigned int flags)
|
2016-09-05 00:08:11 +08:00
|
|
|
{
|
|
|
|
const char *be_name = "files";
|
|
|
|
struct ref_storage_be *be = find_ref_storage_backend(be_name);
|
2017-02-10 19:16:14 +08:00
|
|
|
struct ref_store *refs;
|
2016-09-05 00:08:11 +08:00
|
|
|
|
|
|
|
if (!be)
|
|
|
|
die("BUG: reference backend %s is unknown", be_name);
|
|
|
|
|
2017-03-26 10:42:32 +08:00
|
|
|
refs = be->init(gitdir, flags);
|
2017-02-10 19:16:14 +08:00
|
|
|
return refs;
|
2016-09-05 00:08:11 +08:00
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:29 +08:00
|
|
|
struct ref_store *get_main_ref_store(void)
|
2017-03-26 10:42:25 +08:00
|
|
|
{
|
|
|
|
if (main_ref_store)
|
|
|
|
return main_ref_store;
|
|
|
|
|
2017-04-24 18:01:21 +08:00
|
|
|
main_ref_store = ref_store_init(get_git_dir(), REF_STORE_ALL_CAPS);
|
2017-03-26 10:42:28 +08:00
|
|
|
return main_ref_store;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2017-04-04 18:21:20 +08:00
|
|
|
* Associate a ref store with a name. It is a fatal error to call this
|
|
|
|
* function twice for the same name.
|
2017-03-26 10:42:28 +08:00
|
|
|
*/
|
2017-04-04 18:21:20 +08:00
|
|
|
static void register_ref_store_map(struct hashmap *map,
|
|
|
|
const char *type,
|
|
|
|
struct ref_store *refs,
|
|
|
|
const char *name)
|
2017-03-26 10:42:28 +08:00
|
|
|
{
|
2017-04-04 18:21:20 +08:00
|
|
|
if (!map->tablesize)
|
2017-07-01 03:14:05 +08:00
|
|
|
hashmap_init(map, ref_store_hash_cmp, NULL, 0);
|
2017-03-26 10:42:28 +08:00
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
if (hashmap_put(map, alloc_ref_store_hash_entry(name, refs)))
|
|
|
|
die("BUG: %s ref_store '%s' initialized twice", type, name);
|
2017-03-26 10:42:25 +08:00
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:33 +08:00
|
|
|
struct ref_store *get_submodule_ref_store(const char *submodule)
|
2016-09-05 00:08:11 +08:00
|
|
|
{
|
2017-03-26 10:42:27 +08:00
|
|
|
struct strbuf submodule_sb = STRBUF_INIT;
|
2016-09-05 00:08:11 +08:00
|
|
|
struct ref_store *refs;
|
2017-08-23 20:36:54 +08:00
|
|
|
char *to_free = NULL;
|
|
|
|
size_t len;
|
|
|
|
|
|
|
|
if (submodule) {
|
|
|
|
len = strlen(submodule);
|
|
|
|
while (len && is_dir_sep(submodule[len - 1]))
|
|
|
|
len--;
|
|
|
|
if (!len)
|
|
|
|
return NULL;
|
|
|
|
}
|
2016-09-05 00:08:11 +08:00
|
|
|
|
|
|
|
if (!submodule || !*submodule) {
|
2017-03-26 10:42:33 +08:00
|
|
|
/*
|
|
|
|
* FIXME: This case is ideally not allowed. But that
|
|
|
|
* can't happen until we clean up all the callers.
|
|
|
|
*/
|
2017-03-26 10:42:25 +08:00
|
|
|
return get_main_ref_store();
|
2017-03-26 10:42:27 +08:00
|
|
|
}
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2017-08-23 20:36:54 +08:00
|
|
|
if (submodule[len])
|
|
|
|
/* We need to strip off one or more trailing slashes */
|
|
|
|
submodule = to_free = xmemdupz(submodule, len);
|
|
|
|
|
2017-04-04 18:21:20 +08:00
|
|
|
refs = lookup_ref_store_map(&submodule_ref_stores, submodule);
|
2017-03-26 10:42:27 +08:00
|
|
|
if (refs)
|
2017-08-23 20:36:53 +08:00
|
|
|
goto done;
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2017-03-26 10:42:27 +08:00
|
|
|
strbuf_addstr(&submodule_sb, submodule);
|
2017-08-23 20:36:53 +08:00
|
|
|
if (!is_nonbare_repository_dir(&submodule_sb))
|
|
|
|
goto done;
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2017-08-23 20:36:53 +08:00
|
|
|
if (submodule_to_gitdir(&submodule_sb, submodule))
|
|
|
|
goto done;
|
2016-09-05 00:08:11 +08:00
|
|
|
|
2017-03-26 10:42:32 +08:00
|
|
|
/* assume that add_submodule_odb() has been called */
|
|
|
|
refs = ref_store_init(submodule_sb.buf,
|
|
|
|
REF_STORE_READ | REF_STORE_ODB);
|
2017-04-04 18:21:20 +08:00
|
|
|
register_ref_store_map(&submodule_ref_stores, "submodule",
|
|
|
|
refs, submodule);
|
2017-03-26 10:42:31 +08:00
|
|
|
|
2017-08-23 20:36:53 +08:00
|
|
|
done:
|
2017-03-26 10:42:31 +08:00
|
|
|
strbuf_release(&submodule_sb);
|
2017-08-23 20:36:54 +08:00
|
|
|
free(to_free);
|
|
|
|
|
2016-09-05 00:08:11 +08:00
|
|
|
return refs;
|
|
|
|
}
|
|
|
|
|
2017-04-24 18:01:22 +08:00
|
|
|
struct ref_store *get_worktree_ref_store(const struct worktree *wt)
|
|
|
|
{
|
|
|
|
struct ref_store *refs;
|
|
|
|
const char *id;
|
|
|
|
|
|
|
|
if (wt->is_current)
|
|
|
|
return get_main_ref_store();
|
|
|
|
|
|
|
|
id = wt->id ? wt->id : "/";
|
|
|
|
refs = lookup_ref_store_map(&worktree_ref_stores, id);
|
|
|
|
if (refs)
|
|
|
|
return refs;
|
|
|
|
|
|
|
|
if (wt->id)
|
|
|
|
refs = ref_store_init(git_common_path("worktrees/%s", wt->id),
|
|
|
|
REF_STORE_ALL_CAPS);
|
|
|
|
else
|
|
|
|
refs = ref_store_init(get_git_common_dir(),
|
|
|
|
REF_STORE_ALL_CAPS);
|
|
|
|
|
|
|
|
if (refs)
|
|
|
|
register_ref_store_map(&worktree_ref_stores, "worktree",
|
|
|
|
refs, id);
|
|
|
|
return refs;
|
|
|
|
}
|
|
|
|
|
2017-02-10 19:16:11 +08:00
|
|
|
void base_ref_store_init(struct ref_store *refs,
|
2017-02-10 19:16:17 +08:00
|
|
|
const struct ref_storage_be *be)
|
2016-09-05 00:08:11 +08:00
|
|
|
{
|
2017-02-10 19:16:11 +08:00
|
|
|
refs->be = be;
|
2016-09-05 00:08:11 +08:00
|
|
|
}
|
2016-09-05 00:08:16 +08:00
|
|
|
|
|
|
|
/* backend functions */
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_pack_refs(struct ref_store *refs, unsigned int flags)
|
2016-09-05 00:08:27 +08:00
|
|
|
{
|
|
|
|
return refs->be->pack_refs(refs, flags);
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_peel_ref(struct ref_store *refs, const char *refname,
|
|
|
|
unsigned char *sha1)
|
|
|
|
{
|
|
|
|
return refs->be->peel_ref(refs, refname, sha1);
|
2016-09-05 00:08:27 +08:00
|
|
|
}
|
|
|
|
|
2016-09-05 00:08:29 +08:00
|
|
|
int peel_ref(const char *refname, unsigned char *sha1)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_peel_ref(get_main_ref_store(), refname, sha1);
|
|
|
|
}
|
2016-09-05 00:08:29 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_create_symref(struct ref_store *refs,
|
|
|
|
const char *ref_target,
|
|
|
|
const char *refs_heads_master,
|
|
|
|
const char *logmsg)
|
|
|
|
{
|
|
|
|
return refs->be->create_symref(refs, ref_target,
|
|
|
|
refs_heads_master,
|
|
|
|
logmsg);
|
2016-09-05 00:08:29 +08:00
|
|
|
}
|
|
|
|
|
2016-09-05 00:08:28 +08:00
|
|
|
int create_symref(const char *ref_target, const char *refs_heads_master,
|
|
|
|
const char *logmsg)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_create_symref(get_main_ref_store(), ref_target,
|
|
|
|
refs_heads_master, logmsg);
|
2016-09-05 00:08:28 +08:00
|
|
|
}
|
|
|
|
|
2017-05-22 22:17:45 +08:00
|
|
|
int ref_update_reject_duplicates(struct string_list *refnames,
|
|
|
|
struct strbuf *err)
|
|
|
|
{
|
2017-05-22 22:17:46 +08:00
|
|
|
size_t i, n = refnames->nr;
|
2017-05-22 22:17:45 +08:00
|
|
|
|
|
|
|
assert(err);
|
|
|
|
|
2017-05-22 22:17:47 +08:00
|
|
|
for (i = 1; i < n; i++) {
|
|
|
|
int cmp = strcmp(refnames->items[i - 1].string,
|
|
|
|
refnames->items[i].string);
|
|
|
|
|
|
|
|
if (!cmp) {
|
2017-05-22 22:17:45 +08:00
|
|
|
strbuf_addf(err,
|
|
|
|
"multiple updates for ref '%s' not allowed.",
|
|
|
|
refnames->items[i].string);
|
|
|
|
return 1;
|
2017-05-22 22:17:47 +08:00
|
|
|
} else if (cmp > 0) {
|
|
|
|
die("BUG: ref_update_reject_duplicates() received unsorted list");
|
2017-05-22 22:17:45 +08:00
|
|
|
}
|
2017-05-22 22:17:47 +08:00
|
|
|
}
|
2017-05-22 22:17:45 +08:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
ref_transaction_prepare(): new optional step for reference updates
In the future, compound reference stores will sometimes need to modify
references in two different reference stores at the same time, meaning
that a single logical reference transaction might have to be
implemented as two internal sub-transactions. They won't want to call
`ref_transaction_commit()` for the two sub-transactions one after the
other, because that wouldn't be atomic (the first commit could succeed
and the second one fail). Instead, they will want to prepare both
sub-transactions (i.e., obtain any necessary locks and do any
pre-checks), and only if both prepare steps succeed, then commit both
sub-transactions.
Start preparing for that day by adding a new, optional
`ref_transaction_prepare()` step to the reference transaction
sequence, which obtains the locks and does any prechecks, reporting
any errors that occur. Also add a `ref_transaction_abort()` function
that can be used to abort a sub-transaction even if it has already
been prepared.
That is on the side of the public-facing API. On the side of the
`ref_store` VTABLE, get rid of `transaction_commit` and instead add
methods `transaction_prepare`, `transaction_finish`, and
`transaction_abort`. A `ref_transaction_commit()` now basically calls
methods `transaction_prepare` then `transaction_finish`.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-22 22:17:44 +08:00
|
|
|
int ref_transaction_prepare(struct ref_transaction *transaction,
|
|
|
|
struct strbuf *err)
|
2016-09-05 00:08:16 +08:00
|
|
|
{
|
2017-03-26 10:42:35 +08:00
|
|
|
struct ref_store *refs = transaction->ref_store;
|
2016-09-05 00:08:16 +08:00
|
|
|
|
2017-05-22 22:17:43 +08:00
|
|
|
switch (transaction->state) {
|
|
|
|
case REF_TRANSACTION_OPEN:
|
|
|
|
/* Good. */
|
|
|
|
break;
|
ref_transaction_prepare(): new optional step for reference updates
In the future, compound reference stores will sometimes need to modify
references in two different reference stores at the same time, meaning
that a single logical reference transaction might have to be
implemented as two internal sub-transactions. They won't want to call
`ref_transaction_commit()` for the two sub-transactions one after the
other, because that wouldn't be atomic (the first commit could succeed
and the second one fail). Instead, they will want to prepare both
sub-transactions (i.e., obtain any necessary locks and do any
pre-checks), and only if both prepare steps succeed, then commit both
sub-transactions.
Start preparing for that day by adding a new, optional
`ref_transaction_prepare()` step to the reference transaction
sequence, which obtains the locks and does any prechecks, reporting
any errors that occur. Also add a `ref_transaction_abort()` function
that can be used to abort a sub-transaction even if it has already
been prepared.
That is on the side of the public-facing API. On the side of the
`ref_store` VTABLE, get rid of `transaction_commit` and instead add
methods `transaction_prepare`, `transaction_finish`, and
`transaction_abort`. A `ref_transaction_commit()` now basically calls
methods `transaction_prepare` then `transaction_finish`.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-22 22:17:44 +08:00
|
|
|
case REF_TRANSACTION_PREPARED:
|
|
|
|
die("BUG: prepare called twice on reference transaction");
|
|
|
|
break;
|
2017-05-22 22:17:43 +08:00
|
|
|
case REF_TRANSACTION_CLOSED:
|
|
|
|
die("BUG: prepare called on a closed reference transaction");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
die("BUG: unexpected reference transaction state");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2017-04-11 06:14:12 +08:00
|
|
|
if (getenv(GIT_QUARANTINE_ENVIRONMENT)) {
|
|
|
|
strbuf_addstr(err,
|
|
|
|
_("ref updates forbidden inside quarantine environment"));
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
ref_transaction_prepare(): new optional step for reference updates
In the future, compound reference stores will sometimes need to modify
references in two different reference stores at the same time, meaning
that a single logical reference transaction might have to be
implemented as two internal sub-transactions. They won't want to call
`ref_transaction_commit()` for the two sub-transactions one after the
other, because that wouldn't be atomic (the first commit could succeed
and the second one fail). Instead, they will want to prepare both
sub-transactions (i.e., obtain any necessary locks and do any
pre-checks), and only if both prepare steps succeed, then commit both
sub-transactions.
Start preparing for that day by adding a new, optional
`ref_transaction_prepare()` step to the reference transaction
sequence, which obtains the locks and does any prechecks, reporting
any errors that occur. Also add a `ref_transaction_abort()` function
that can be used to abort a sub-transaction even if it has already
been prepared.
That is on the side of the public-facing API. On the side of the
`ref_store` VTABLE, get rid of `transaction_commit` and instead add
methods `transaction_prepare`, `transaction_finish`, and
`transaction_abort`. A `ref_transaction_commit()` now basically calls
methods `transaction_prepare` then `transaction_finish`.
Signed-off-by: Michael Haggerty <mhagger@alum.mit.edu>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
2017-05-22 22:17:44 +08:00
|
|
|
return refs->be->transaction_prepare(refs, transaction, err);
|
|
|
|
}
|
|
|
|
|
|
|
|
int ref_transaction_abort(struct ref_transaction *transaction,
|
|
|
|
struct strbuf *err)
|
|
|
|
{
|
|
|
|
struct ref_store *refs = transaction->ref_store;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
switch (transaction->state) {
|
|
|
|
case REF_TRANSACTION_OPEN:
|
|
|
|
/* No need to abort explicitly. */
|
|
|
|
break;
|
|
|
|
case REF_TRANSACTION_PREPARED:
|
|
|
|
ret = refs->be->transaction_abort(refs, transaction, err);
|
|
|
|
break;
|
|
|
|
case REF_TRANSACTION_CLOSED:
|
|
|
|
die("BUG: abort called on a closed reference transaction");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
die("BUG: unexpected reference transaction state");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
ref_transaction_free(transaction);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ref_transaction_commit(struct ref_transaction *transaction,
|
|
|
|
struct strbuf *err)
|
|
|
|
{
|
|
|
|
struct ref_store *refs = transaction->ref_store;
|
|
|
|
int ret;
|
|
|
|
|
|
|
|
switch (transaction->state) {
|
|
|
|
case REF_TRANSACTION_OPEN:
|
|
|
|
/* Need to prepare first. */
|
|
|
|
ret = ref_transaction_prepare(transaction, err);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
break;
|
|
|
|
case REF_TRANSACTION_PREPARED:
|
|
|
|
/* Fall through to finish. */
|
|
|
|
break;
|
|
|
|
case REF_TRANSACTION_CLOSED:
|
|
|
|
die("BUG: commit called on a closed reference transaction");
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
die("BUG: unexpected reference transaction state");
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
return refs->be->transaction_finish(refs, transaction, err);
|
2016-09-05 00:08:16 +08:00
|
|
|
}
|
2016-09-05 00:08:26 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_verify_refname_available(struct ref_store *refs,
|
|
|
|
const char *refname,
|
2017-04-16 14:41:26 +08:00
|
|
|
const struct string_list *extras,
|
2017-03-26 10:42:34 +08:00
|
|
|
const struct string_list *skip,
|
|
|
|
struct strbuf *err)
|
2016-09-05 00:08:26 +08:00
|
|
|
{
|
2017-04-16 14:41:26 +08:00
|
|
|
const char *slash;
|
|
|
|
const char *extra_refname;
|
|
|
|
struct strbuf dirname = STRBUF_INIT;
|
|
|
|
struct strbuf referent = STRBUF_INIT;
|
|
|
|
struct object_id oid;
|
|
|
|
unsigned int type;
|
|
|
|
struct ref_iterator *iter;
|
|
|
|
int ok;
|
|
|
|
int ret = -1;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* For the sake of comments in this function, suppose that
|
|
|
|
* refname is "refs/foo/bar".
|
|
|
|
*/
|
|
|
|
|
|
|
|
assert(err);
|
|
|
|
|
|
|
|
strbuf_grow(&dirname, strlen(refname) + 1);
|
|
|
|
for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) {
|
|
|
|
/* Expand dirname to the new prefix, not including the trailing slash: */
|
|
|
|
strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We are still at a leading dir of the refname (e.g.,
|
|
|
|
* "refs/foo"; if there is a reference with that name,
|
|
|
|
* it is a conflict, *unless* it is in skip.
|
|
|
|
*/
|
|
|
|
if (skip && string_list_has_string(skip, dirname.buf))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
if (!refs_read_raw_ref(refs, dirname.buf, oid.hash, &referent, &type)) {
|
|
|
|
strbuf_addf(err, "'%s' exists; cannot create '%s'",
|
|
|
|
dirname.buf, refname);
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (extras && string_list_has_string(extras, dirname.buf)) {
|
|
|
|
strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
|
|
|
|
refname, dirname.buf);
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* We are at the leaf of our refname (e.g., "refs/foo/bar").
|
|
|
|
* There is no point in searching for a reference with that
|
|
|
|
* name, because a refname isn't considered to conflict with
|
|
|
|
* itself. But we still need to check for references whose
|
|
|
|
* names are in the "refs/foo/bar/" namespace, because they
|
|
|
|
* *do* conflict.
|
|
|
|
*/
|
|
|
|
strbuf_addstr(&dirname, refname + dirname.len);
|
|
|
|
strbuf_addch(&dirname, '/');
|
|
|
|
|
|
|
|
iter = refs_ref_iterator_begin(refs, dirname.buf, 0,
|
|
|
|
DO_FOR_EACH_INCLUDE_BROKEN);
|
|
|
|
while ((ok = ref_iterator_advance(iter)) == ITER_OK) {
|
|
|
|
if (skip &&
|
|
|
|
string_list_has_string(skip, iter->refname))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
strbuf_addf(err, "'%s' exists; cannot create '%s'",
|
|
|
|
iter->refname, refname);
|
|
|
|
ref_iterator_abort(iter);
|
|
|
|
goto cleanup;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ok != ITER_DONE)
|
|
|
|
die("BUG: error while iterating over references");
|
|
|
|
|
|
|
|
extra_refname = find_descendant_ref(dirname.buf, extras, skip);
|
|
|
|
if (extra_refname)
|
|
|
|
strbuf_addf(err, "cannot process '%s' and '%s' at the same time",
|
|
|
|
refname, extra_refname);
|
|
|
|
else
|
|
|
|
ret = 0;
|
|
|
|
|
|
|
|
cleanup:
|
|
|
|
strbuf_release(&referent);
|
|
|
|
strbuf_release(&dirname);
|
|
|
|
return ret;
|
2016-09-05 00:08:26 +08:00
|
|
|
}
|
2016-09-05 00:08:38 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_for_each_reflog(struct ref_store *refs, each_ref_fn fn, void *cb_data)
|
2016-09-05 00:08:38 +08:00
|
|
|
{
|
|
|
|
struct ref_iterator *iter;
|
|
|
|
|
|
|
|
iter = refs->be->reflog_iterator_begin(refs);
|
|
|
|
|
|
|
|
return do_for_each_ref_iterator(iter, fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int for_each_reflog(each_ref_fn fn, void *cb_data)
|
2016-09-05 00:08:38 +08:00
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_reflog(get_main_ref_store(), fn, cb_data);
|
|
|
|
}
|
2016-09-05 00:08:38 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_for_each_reflog_ent_reverse(struct ref_store *refs,
|
|
|
|
const char *refname,
|
|
|
|
each_reflog_ent_fn fn,
|
|
|
|
void *cb_data)
|
|
|
|
{
|
2016-09-05 00:08:38 +08:00
|
|
|
return refs->be->for_each_reflog_ent_reverse(refs, refname,
|
|
|
|
fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn,
|
|
|
|
void *cb_data)
|
|
|
|
{
|
|
|
|
return refs_for_each_reflog_ent_reverse(get_main_ref_store(),
|
|
|
|
refname, fn, cb_data);
|
|
|
|
}
|
|
|
|
|
|
|
|
int refs_for_each_reflog_ent(struct ref_store *refs, const char *refname,
|
|
|
|
each_reflog_ent_fn fn, void *cb_data)
|
|
|
|
{
|
|
|
|
return refs->be->for_each_reflog_ent(refs, refname, fn, cb_data);
|
|
|
|
}
|
|
|
|
|
2016-09-05 00:08:38 +08:00
|
|
|
int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn,
|
|
|
|
void *cb_data)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_for_each_reflog_ent(get_main_ref_store(), refname,
|
|
|
|
fn, cb_data);
|
|
|
|
}
|
2016-09-05 00:08:38 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_reflog_exists(struct ref_store *refs, const char *refname)
|
|
|
|
{
|
|
|
|
return refs->be->reflog_exists(refs, refname);
|
2016-09-05 00:08:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int reflog_exists(const char *refname)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_reflog_exists(get_main_ref_store(), refname);
|
|
|
|
}
|
2016-09-05 00:08:38 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_create_reflog(struct ref_store *refs, const char *refname,
|
|
|
|
int force_create, struct strbuf *err)
|
|
|
|
{
|
|
|
|
return refs->be->create_reflog(refs, refname, force_create, err);
|
2016-09-05 00:08:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int safe_create_reflog(const char *refname, int force_create,
|
|
|
|
struct strbuf *err)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_create_reflog(get_main_ref_store(), refname,
|
|
|
|
force_create, err);
|
|
|
|
}
|
2016-09-05 00:08:38 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_delete_reflog(struct ref_store *refs, const char *refname)
|
|
|
|
{
|
|
|
|
return refs->be->delete_reflog(refs, refname);
|
2016-09-05 00:08:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int delete_reflog(const char *refname)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_delete_reflog(get_main_ref_store(), refname);
|
|
|
|
}
|
2016-09-05 00:08:38 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_reflog_expire(struct ref_store *refs,
|
|
|
|
const char *refname, const unsigned char *sha1,
|
|
|
|
unsigned int flags,
|
|
|
|
reflog_expiry_prepare_fn prepare_fn,
|
|
|
|
reflog_expiry_should_prune_fn should_prune_fn,
|
|
|
|
reflog_expiry_cleanup_fn cleanup_fn,
|
|
|
|
void *policy_cb_data)
|
|
|
|
{
|
|
|
|
return refs->be->reflog_expire(refs, refname, sha1, flags,
|
|
|
|
prepare_fn, should_prune_fn,
|
|
|
|
cleanup_fn, policy_cb_data);
|
2016-09-05 00:08:38 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
int reflog_expire(const char *refname, const unsigned char *sha1,
|
|
|
|
unsigned int flags,
|
|
|
|
reflog_expiry_prepare_fn prepare_fn,
|
|
|
|
reflog_expiry_should_prune_fn should_prune_fn,
|
|
|
|
reflog_expiry_cleanup_fn cleanup_fn,
|
|
|
|
void *policy_cb_data)
|
|
|
|
{
|
2017-03-26 10:42:34 +08:00
|
|
|
return refs_reflog_expire(get_main_ref_store(),
|
|
|
|
refname, sha1, flags,
|
|
|
|
prepare_fn, should_prune_fn,
|
|
|
|
cleanup_fn, policy_cb_data);
|
2016-09-05 00:08:38 +08:00
|
|
|
}
|
2016-09-05 00:08:39 +08:00
|
|
|
|
|
|
|
int initial_ref_transaction_commit(struct ref_transaction *transaction,
|
|
|
|
struct strbuf *err)
|
|
|
|
{
|
2017-03-26 10:42:35 +08:00
|
|
|
struct ref_store *refs = transaction->ref_store;
|
2016-09-05 00:08:39 +08:00
|
|
|
|
|
|
|
return refs->be->initial_transaction_commit(refs, transaction, err);
|
|
|
|
}
|
2016-09-05 00:08:40 +08:00
|
|
|
|
2017-05-22 22:17:38 +08:00
|
|
|
int refs_delete_refs(struct ref_store *refs, const char *msg,
|
|
|
|
struct string_list *refnames, unsigned int flags)
|
2016-09-05 00:08:40 +08:00
|
|
|
{
|
2017-05-22 22:17:38 +08:00
|
|
|
return refs->be->delete_refs(refs, msg, refnames, flags);
|
2016-09-05 00:08:40 +08:00
|
|
|
}
|
2016-09-05 00:08:42 +08:00
|
|
|
|
2017-05-22 22:17:38 +08:00
|
|
|
int delete_refs(const char *msg, struct string_list *refnames,
|
|
|
|
unsigned int flags)
|
2016-09-05 00:08:42 +08:00
|
|
|
{
|
2017-05-22 22:17:38 +08:00
|
|
|
return refs_delete_refs(get_main_ref_store(), msg, refnames, flags);
|
2017-03-26 10:42:34 +08:00
|
|
|
}
|
2016-09-05 00:08:42 +08:00
|
|
|
|
2017-03-26 10:42:34 +08:00
|
|
|
int refs_rename_ref(struct ref_store *refs, const char *oldref,
|
|
|
|
const char *newref, const char *logmsg)
|
|
|
|
{
|
2016-09-05 00:08:42 +08:00
|
|
|
return refs->be->rename_ref(refs, oldref, newref, logmsg);
|
|
|
|
}
|
2017-03-26 10:42:34 +08:00
|
|
|
|
|
|
|
int rename_ref(const char *oldref, const char *newref, const char *logmsg)
|
|
|
|
{
|
|
|
|
return refs_rename_ref(get_main_ref_store(), oldref, newref, logmsg);
|
|
|
|
}
|