fetch.c

   1 #include "fetch.h"
   2
   3 #include "cache.h"
   4 #include "commit.h"
   5 #include "tree.h"
   6 #include "tag.h"
   7 #include "blob.h"
   8 #include "refs.h"
   9
  10 const char *write_ref = NULL;
  11
  12 const unsigned char *current_ref = NULL;
  13
  14 int get_tree = 0;
  15 int get_history = 0;
  16 int get_all = 0;
  17 int get_verbosely = 0;
  18 static unsigned char current_commit_sha1[20];
  19
  20 void pull_say(const char *fmt, const char *hex)
  21 {
  22         if (get_verbosely)
  23                 fprintf(stderr, fmt, hex);
  24 }
  25
  26 static void report_missing(const char *what, const unsigned char *missing)
  27 {
  28         char missing_hex[41];
  29
  30         strcpy(missing_hex, sha1_to_hex(missing));;
  31         fprintf(stderr,
  32                 "Cannot obtain needed %s %s\nwhile processing commit %s.\n",
  33                 what, missing_hex, sha1_to_hex(current_commit_sha1));
  34 }
  35
  36 static int process(unsigned char *sha1, const char *type);
  37
  38 static int process_tree(struct tree *tree)
  39 {
  40         struct tree_entry_list *entry;
  41
  42         if (parse_tree(tree))
  43                 return -1;
  44
  45         entry = tree->entries;
  46         tree->entries = NULL;
  47         while (entry) {
  48                 struct tree_entry_list *next = entry->next;
  49                 if (process(entry->item.any->sha1,
  50                             entry->directory ? tree_type : blob_type))
  51                         return -1;
  52                 free(entry);
  53                 entry = next;
  54         }
  55         return 0;
  56 }
  57
  58 #define COMPLETE        1U
  59 #define TO_FETCH        2U
  60 #define TO_SCAN         4U
  61 #define SCANNED         8U
  62
  63 static struct commit_list *complete = NULL;
  64
  65 static int process_commit(struct commit *commit)
  66 {
  67         if (parse_commit(commit))
  68                 return -1;
  69
  70         while (complete && complete->item->date >= commit->date) {
  71                 pop_most_recent_commit(&complete, COMPLETE);
  72         }
  73
  74         if (commit->object.flags & COMPLETE)
  75                 return 0;
  76
  77         memcpy(current_commit_sha1, commit->object.sha1, 20);
  78
  79         pull_say("walk %s\n", sha1_to_hex(commit->object.sha1));
  80
  81         if (get_tree) {
  82                 if (process(commit->tree->object.sha1, tree_type))
  83                         return -1;
  84                 if (!get_all)
  85                         get_tree = 0;
  86         }
  87         if (get_history) {
  88                 struct commit_list *parents = commit->parents;
  89                 for (; parents; parents = parents->next) {
  90                         if (process(parents->item->object.sha1, commit_type))
  91                                 return -1;
  92                 }
  93         }
  94         return 0;
  95 }
  96
  97 static int process_tag(struct tag *tag)
  98 {
  99         if (parse_tag(tag))
 100                 return -1;
 101         return process(tag->tagged->sha1, NULL);
 102 }
 103
 104 static struct object_list *process_queue = NULL;
 105 static struct object_list **process_queue_end = &process_queue;
 106
 107 static int process_object(struct object *obj)
 108 {
 109         if (obj->flags & SCANNED)
 110                 return 0;
 111         obj->flags |= SCANNED;
 112
 113         if (obj->type == commit_type) {
 114                 if (process_commit((struct commit *)obj))
 115                         return -1;
 116                 return 0;
 117         }
 118         if (obj->type == tree_type) {
 119                 if (process_tree((struct tree *)obj))
 120                         return -1;
 121                 return 0;
 122         }
 123         if (obj->type == blob_type) {
 124                 return 0;
 125         }
 126         if (obj->type == tag_type) {
 127                 if (process_tag((struct tag *)obj))
 128                         return -1;
 129                 return 0;
 130         }
 131         return error("Unable to determine requirements "
 132                      "of type %s for %s",
 133                      obj->type, sha1_to_hex(obj->sha1));
 134 }
 135
 136 static int process(unsigned char *sha1, const char *type)
 137 {
 138         struct object *obj = lookup_object_type(sha1, type);
 139
 140         if (has_sha1_file(sha1)) {
 141                 parse_object(sha1);
 142                 /* We already have it, so we should scan it now. */
 143                 if (obj->flags & (SCANNED | TO_SCAN))
 144                         return 0;
 145                 object_list_insert(obj, process_queue_end);
 146                 process_queue_end = &(*process_queue_end)->next;
 147                 obj->flags |= TO_SCAN;
 148                 return 0;
 149         }
 150         if (obj->flags & (COMPLETE | TO_FETCH))
 151                 return 0;
 152         object_list_insert(obj, process_queue_end);
 153         process_queue_end = &(*process_queue_end)->next;
 154         obj->flags |= TO_FETCH;
 155
 156         prefetch(sha1);
 157
 158         return 0;
 159 }
 160
 161 static int loop(void)
 162 {
 163         struct object_list *elem;
 164
 165         while (process_queue) {
 166                 struct object *obj = process_queue->item;
 167                 elem = process_queue;
 168                 process_queue = elem->next;
 169                 free(elem);
 170                 if (!process_queue)
 171                         process_queue_end = &process_queue;
 172
 173                 /* If we are not scanning this object, we placed it in
 174                  * the queue because we needed to fetch it first.
 175                  */
 176                 if (! (obj->flags & TO_SCAN)) {
 177                         if (!has_sha1_file(obj->sha1) && fetch(obj->sha1)) {
 178                                 report_missing(obj->type
 179                                                ? obj->type
 180                                                : "object", obj->sha1);
 181                                 return -1;
 182                         }
 183                 }
 184                 if (!obj->type)
 185                         parse_object(obj->sha1);
 186                 if (process_object(obj))
 187                         return -1;
 188         }
 189         return 0;
 190 }
 191
 192 static int interpret_target(char *target, unsigned char *sha1)
 193 {
 194         if (!get_sha1_hex(target, sha1))
 195                 return 0;
 196         if (!check_ref_format(target)) {
 197                 if (!fetch_ref(target, sha1)) {
 198                         return 0;
 199                 }
 200         }
 201         return -1;
 202 }
 203
 204 static int mark_complete(const char *path, const unsigned char *sha1)
 205 {
 206         struct commit *commit = lookup_commit_reference_gently(sha1, 1);
 207         if (commit) {
 208                 commit->object.flags |= COMPLETE;
 209                 insert_by_date(commit, &complete);
 210         }
 211         return 0;
 212 }
 213
 214 int pull(char *target)
 215 {
 216         unsigned char sha1[20];
 217         int fd = -1;
 218
 219         save_commit_buffer = 0;
 220         if (write_ref && current_ref) {
 221                 fd = lock_ref_sha1(write_ref, current_ref);
 222                 if (fd < 0)
 223                         return -1;
 224         }
 225
 226         for_each_ref(mark_complete);
 227
 228         if (interpret_target(target, sha1))
 229                 return error("Could not interpret %s as something to pull",
 230                              target);
 231         if (process(sha1, NULL))
 232                 return -1;
 233         if (loop())
 234                 return -1;
 235
 236         if (write_ref) {
 237                 if (current_ref) {
 238                         write_ref_sha1(write_ref, fd, sha1);
 239                 } else {
 240                         write_ref_sha1_unlocked(write_ref, sha1);
 241                 }
 242         }
 243         return 0;
 244 }