2005-09-08 02:26:23 +02:00
|
|
|
#include "fetch.h"
|
2005-05-01 01:53:56 +02:00
|
|
|
|
|
|
|
#include "cache.h"
|
|
|
|
#include "commit.h"
|
|
|
|
#include "tree.h"
|
2005-06-22 02:35:53 +02:00
|
|
|
#include "tag.h"
|
|
|
|
#include "blob.h"
|
2005-06-06 22:38:26 +02:00
|
|
|
#include "refs.h"
|
|
|
|
|
|
|
|
const char *write_ref = NULL;
|
2006-05-19 09:29:26 +02:00
|
|
|
const char *write_ref_log_details = NULL;
|
2005-06-06 22:38:26 +02:00
|
|
|
|
2005-05-01 01:53:56 +02:00
|
|
|
int get_tree = 0;
|
|
|
|
int get_history = 0;
|
|
|
|
int get_all = 0;
|
2005-05-06 10:37:21 +02:00
|
|
|
int get_verbosely = 0;
|
2005-09-27 03:38:08 +02:00
|
|
|
int get_recover = 0;
|
2005-05-04 10:26:24 +02:00
|
|
|
static unsigned char current_commit_sha1[20];
|
2005-05-01 01:53:56 +02:00
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
void pull_say(const char *fmt, const char *hex)
|
|
|
|
{
|
2005-05-06 10:37:21 +02:00
|
|
|
if (get_verbosely)
|
|
|
|
fprintf(stderr, fmt, hex);
|
|
|
|
}
|
|
|
|
|
2005-05-04 10:26:24 +02:00
|
|
|
static void report_missing(const char *what, const unsigned char *missing)
|
|
|
|
{
|
|
|
|
char missing_hex[41];
|
|
|
|
|
|
|
|
strcpy(missing_hex, sha1_to_hex(missing));;
|
|
|
|
fprintf(stderr,
|
|
|
|
"Cannot obtain needed %s %s\nwhile processing commit %s.\n",
|
|
|
|
what, missing_hex, sha1_to_hex(current_commit_sha1));
|
|
|
|
}
|
|
|
|
|
2005-09-21 18:33:54 +02:00
|
|
|
static int process(struct object *obj);
|
2005-06-22 02:35:53 +02:00
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
static int process_tree(struct tree *tree)
|
2005-05-01 01:53:56 +02:00
|
|
|
{
|
2005-09-18 10:01:07 +02:00
|
|
|
struct tree_entry_list *entry;
|
2005-05-01 01:53:56 +02:00
|
|
|
|
|
|
|
if (parse_tree(tree))
|
|
|
|
return -1;
|
|
|
|
|
2005-09-18 10:01:07 +02:00
|
|
|
entry = tree->entries;
|
|
|
|
tree->entries = NULL;
|
|
|
|
while (entry) {
|
|
|
|
struct tree_entry_list *next = entry->next;
|
2005-09-21 18:33:54 +02:00
|
|
|
if (process(entry->item.any))
|
2005-05-01 01:53:56 +02:00
|
|
|
return -1;
|
2005-09-23 14:28:18 +02:00
|
|
|
free(entry->name);
|
2005-09-18 10:01:07 +02:00
|
|
|
free(entry);
|
|
|
|
entry = next;
|
2005-05-01 01:53:56 +02:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-09-21 18:34:24 +02:00
|
|
|
#define COMPLETE (1U << 0)
|
|
|
|
#define SEEN (1U << 1)
|
|
|
|
#define TO_SCAN (1U << 2)
|
2005-09-18 10:01:07 +02:00
|
|
|
|
2005-09-16 23:30:29 +02:00
|
|
|
static struct commit_list *complete = NULL;
|
2005-09-15 03:31:42 +02:00
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
static int process_commit(struct commit *commit)
|
2005-05-01 01:53:56 +02:00
|
|
|
{
|
2005-08-03 01:46:10 +02:00
|
|
|
if (parse_commit(commit))
|
2005-05-01 01:53:56 +02:00
|
|
|
return -1;
|
|
|
|
|
2005-09-15 03:31:42 +02:00
|
|
|
while (complete && complete->item->date >= commit->date) {
|
2005-09-16 23:30:29 +02:00
|
|
|
pop_most_recent_commit(&complete, COMPLETE);
|
2005-09-15 03:31:42 +02:00
|
|
|
}
|
|
|
|
|
2005-09-16 23:30:29 +02:00
|
|
|
if (commit->object.flags & COMPLETE)
|
2005-09-15 03:31:42 +02:00
|
|
|
return 0;
|
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
memcpy(current_commit_sha1, commit->object.sha1, 20);
|
2005-05-01 01:53:56 +02:00
|
|
|
|
2005-09-18 10:01:07 +02:00
|
|
|
pull_say("walk %s\n", sha1_to_hex(commit->object.sha1));
|
|
|
|
|
2005-05-01 01:53:56 +02:00
|
|
|
if (get_tree) {
|
2005-09-21 18:33:54 +02:00
|
|
|
if (process(&commit->tree->object))
|
2005-05-01 01:53:56 +02:00
|
|
|
return -1;
|
|
|
|
if (!get_all)
|
|
|
|
get_tree = 0;
|
|
|
|
}
|
|
|
|
if (get_history) {
|
2005-08-03 01:46:10 +02:00
|
|
|
struct commit_list *parents = commit->parents;
|
2005-05-01 01:53:56 +02:00
|
|
|
for (; parents; parents = parents->next) {
|
2005-09-21 18:33:54 +02:00
|
|
|
if (process(&parents->item->object))
|
2005-05-01 01:53:56 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
static int process_tag(struct tag *tag)
|
2005-06-22 02:35:53 +02:00
|
|
|
{
|
2005-08-03 01:46:10 +02:00
|
|
|
if (parse_tag(tag))
|
2005-06-22 02:35:53 +02:00
|
|
|
return -1;
|
2005-09-21 18:33:54 +02:00
|
|
|
return process(tag->tagged);
|
2005-06-22 02:35:53 +02:00
|
|
|
}
|
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
static struct object_list *process_queue = NULL;
|
|
|
|
static struct object_list **process_queue_end = &process_queue;
|
|
|
|
|
2005-08-12 01:38:09 +02:00
|
|
|
static int process_object(struct object *obj)
|
2005-06-22 02:35:53 +02:00
|
|
|
{
|
2005-08-12 01:38:09 +02:00
|
|
|
if (obj->type == commit_type) {
|
|
|
|
if (process_commit((struct commit *)obj))
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (obj->type == tree_type) {
|
|
|
|
if (process_tree((struct tree *)obj))
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (obj->type == blob_type) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
if (obj->type == tag_type) {
|
|
|
|
if (process_tag((struct tag *)obj))
|
|
|
|
return -1;
|
2005-06-22 02:35:53 +02:00
|
|
|
return 0;
|
2005-08-12 01:38:09 +02:00
|
|
|
}
|
|
|
|
return error("Unable to determine requirements "
|
|
|
|
"of type %s for %s",
|
|
|
|
obj->type, sha1_to_hex(obj->sha1));
|
|
|
|
}
|
|
|
|
|
2005-09-21 18:33:54 +02:00
|
|
|
static int process(struct object *obj)
|
2005-08-12 01:38:09 +02:00
|
|
|
{
|
2005-09-21 18:33:59 +02:00
|
|
|
if (obj->flags & SEEN)
|
|
|
|
return 0;
|
|
|
|
obj->flags |= SEEN;
|
|
|
|
|
2005-09-21 18:33:54 +02:00
|
|
|
if (has_sha1_file(obj->sha1)) {
|
2005-08-12 01:38:09 +02:00
|
|
|
/* We already have it, so we should scan it now. */
|
2005-09-18 10:01:07 +02:00
|
|
|
obj->flags |= TO_SCAN;
|
2005-09-21 18:34:14 +02:00
|
|
|
} else {
|
|
|
|
if (obj->flags & COMPLETE)
|
|
|
|
return 0;
|
|
|
|
prefetch(obj->sha1);
|
2005-08-12 01:38:09 +02:00
|
|
|
}
|
2005-09-21 18:34:14 +02:00
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
object_list_insert(obj, process_queue_end);
|
|
|
|
process_queue_end = &(*process_queue_end)->next;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
static int loop(void)
|
|
|
|
{
|
2005-09-18 10:01:07 +02:00
|
|
|
struct object_list *elem;
|
|
|
|
|
2005-08-03 01:46:10 +02:00
|
|
|
while (process_queue) {
|
|
|
|
struct object *obj = process_queue->item;
|
2005-09-18 10:01:07 +02:00
|
|
|
elem = process_queue;
|
|
|
|
process_queue = elem->next;
|
|
|
|
free(elem);
|
2005-08-03 01:46:10 +02:00
|
|
|
if (!process_queue)
|
|
|
|
process_queue_end = &process_queue;
|
|
|
|
|
2005-09-18 10:01:07 +02:00
|
|
|
/* If we are not scanning this object, we placed it in
|
|
|
|
* the queue because we needed to fetch it first.
|
|
|
|
*/
|
|
|
|
if (! (obj->flags & TO_SCAN)) {
|
2005-10-11 08:22:01 +02:00
|
|
|
if (fetch(obj->sha1)) {
|
2005-09-18 10:01:07 +02:00
|
|
|
report_missing(obj->type
|
|
|
|
? obj->type
|
|
|
|
: "object", obj->sha1);
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
}
|
2005-08-03 01:46:10 +02:00
|
|
|
if (!obj->type)
|
|
|
|
parse_object(obj->sha1);
|
2005-08-12 01:38:09 +02:00
|
|
|
if (process_object(obj))
|
|
|
|
return -1;
|
2005-08-03 01:46:10 +02:00
|
|
|
}
|
|
|
|
return 0;
|
2005-06-22 02:35:53 +02:00
|
|
|
}
|
|
|
|
|
2005-06-06 22:38:26 +02:00
|
|
|
static int interpret_target(char *target, unsigned char *sha1)
|
|
|
|
{
|
|
|
|
if (!get_sha1_hex(target, sha1))
|
|
|
|
return 0;
|
|
|
|
if (!check_ref_format(target)) {
|
|
|
|
if (!fetch_ref(target, sha1)) {
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2005-09-15 03:31:42 +02:00
|
|
|
static int mark_complete(const char *path, const unsigned char *sha1)
|
|
|
|
{
|
2005-09-16 23:30:29 +02:00
|
|
|
struct commit *commit = lookup_commit_reference_gently(sha1, 1);
|
|
|
|
if (commit) {
|
|
|
|
commit->object.flags |= COMPLETE;
|
|
|
|
insert_by_date(commit, &complete);
|
2005-09-15 03:31:42 +02:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2005-06-06 22:38:26 +02:00
|
|
|
|
2005-05-01 01:53:56 +02:00
|
|
|
int pull(char *target)
|
|
|
|
{
|
2006-06-01 00:23:44 +02:00
|
|
|
struct ref_lock *lock = NULL;
|
2005-05-01 01:53:56 +02:00
|
|
|
unsigned char sha1[20];
|
2006-05-19 09:29:26 +02:00
|
|
|
char *msg;
|
|
|
|
int ret;
|
2005-06-06 22:38:26 +02:00
|
|
|
|
2005-09-16 00:06:39 +02:00
|
|
|
save_commit_buffer = 0;
|
2005-09-23 14:28:13 +02:00
|
|
|
track_object_refs = 0;
|
2006-05-17 11:55:02 +02:00
|
|
|
if (write_ref) {
|
2006-05-25 01:49:24 +02:00
|
|
|
lock = lock_ref_sha1(write_ref, NULL, 0);
|
2006-05-19 09:29:26 +02:00
|
|
|
if (!lock) {
|
|
|
|
error("Can't lock ref %s", write_ref);
|
2005-06-06 22:38:26 +02:00
|
|
|
return -1;
|
2006-05-19 09:29:26 +02:00
|
|
|
}
|
2005-06-06 22:38:26 +02:00
|
|
|
}
|
|
|
|
|
2006-05-25 01:42:38 +02:00
|
|
|
if (!get_recover)
|
2005-09-27 03:38:08 +02:00
|
|
|
for_each_ref(mark_complete);
|
2005-09-15 03:31:42 +02:00
|
|
|
|
2006-05-17 11:55:02 +02:00
|
|
|
if (interpret_target(target, sha1)) {
|
|
|
|
error("Could not interpret %s as something to pull", target);
|
2006-06-01 00:23:44 +02:00
|
|
|
if (lock)
|
|
|
|
unlock_ref(lock);
|
2006-05-17 11:55:02 +02:00
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
if (process(lookup_unknown_object(sha1))) {
|
2006-06-01 00:23:44 +02:00
|
|
|
if (lock)
|
|
|
|
unlock_ref(lock);
|
2005-08-03 01:46:10 +02:00
|
|
|
return -1;
|
2006-05-17 11:55:02 +02:00
|
|
|
}
|
|
|
|
if (loop()) {
|
2006-06-01 00:23:44 +02:00
|
|
|
if (lock)
|
|
|
|
unlock_ref(lock);
|
2005-06-06 22:38:26 +02:00
|
|
|
return -1;
|
2006-05-17 11:55:02 +02:00
|
|
|
}
|
|
|
|
|
2005-06-06 22:38:26 +02:00
|
|
|
if (write_ref) {
|
2006-05-19 09:29:26 +02:00
|
|
|
if (write_ref_log_details) {
|
|
|
|
msg = xmalloc(strlen(write_ref_log_details) + 12);
|
|
|
|
sprintf(msg, "fetch from %s", write_ref_log_details);
|
|
|
|
} else
|
|
|
|
msg = NULL;
|
|
|
|
ret = write_ref_sha1(lock, sha1, msg ? msg : "fetch (unknown)");
|
|
|
|
if (msg)
|
|
|
|
free(msg);
|
|
|
|
return ret;
|
2005-06-06 22:38:26 +02:00
|
|
|
}
|
|
|
|
return 0;
|
2005-05-01 01:53:56 +02:00
|
|
|
}
|