list-objects.con commit Merge branch 'jh/quiltimport-explicit-series-file' (db9789a)
   1#include "cache.h"
   2#include "tag.h"
   3#include "commit.h"
   4#include "tree.h"
   5#include "blob.h"
   6#include "diff.h"
   7#include "tree-walk.h"
   8#include "revision.h"
   9#include "list-objects.h"
  10
  11static void process_blob(struct rev_info *revs,
  12                         struct blob *blob,
  13                         show_object_fn show,
  14                         struct name_path *path,
  15                         const char *name,
  16                         void *cb_data)
  17{
  18        struct object *obj = &blob->object;
  19
  20        if (!revs->blob_objects)
  21                return;
  22        if (!obj)
  23                die("bad blob object");
  24        if (obj->flags & (UNINTERESTING | SEEN))
  25                return;
  26        obj->flags |= SEEN;
  27        show(obj, path, name, cb_data);
  28}
  29
  30/*
  31 * Processing a gitlink entry currently does nothing, since
  32 * we do not recurse into the subproject.
  33 *
  34 * We *could* eventually add a flag that actually does that,
  35 * which would involve:
  36 *  - is the subproject actually checked out?
  37 *  - if so, see if the subproject has already been added
  38 *    to the alternates list, and add it if not.
  39 *  - process the commit (or tag) the gitlink points to
  40 *    recursively.
  41 *
  42 * However, it's unclear whether there is really ever any
  43 * reason to see superprojects and subprojects as such a
  44 * "unified" object pool (potentially resulting in a totally
  45 * humongous pack - avoiding which was the whole point of
  46 * having gitlinks in the first place!).
  47 *
  48 * So for now, there is just a note that we *could* follow
  49 * the link, and how to do it. Whether it necessarily makes
  50 * any sense what-so-ever to ever do that is another issue.
  51 */
  52static void process_gitlink(struct rev_info *revs,
  53                            const unsigned char *sha1,
  54                            show_object_fn show,
  55                            struct name_path *path,
  56                            const char *name,
  57                            void *cb_data)
  58{
  59        /* Nothing to do */
  60}
  61
  62static void process_tree(struct rev_info *revs,
  63                         struct tree *tree,
  64                         show_object_fn show,
  65                         struct name_path *path,
  66                         struct strbuf *base,
  67                         const char *name,
  68                         void *cb_data)
  69{
  70        struct object *obj = &tree->object;
  71        struct tree_desc desc;
  72        struct name_entry entry;
  73        struct name_path me;
  74        enum interesting match = revs->diffopt.pathspec.nr == 0 ?
  75                all_entries_interesting: entry_not_interesting;
  76        int baselen = base->len;
  77
  78        if (!revs->tree_objects)
  79                return;
  80        if (!obj)
  81                die("bad tree object");
  82        if (obj->flags & (UNINTERESTING | SEEN))
  83                return;
  84        if (parse_tree_gently(tree, revs->ignore_missing_links) < 0) {
  85                if (revs->ignore_missing_links)
  86                        return;
  87                die("bad tree object %s", sha1_to_hex(obj->sha1));
  88        }
  89        obj->flags |= SEEN;
  90        show(obj, path, name, cb_data);
  91        me.up = path;
  92        me.elem = name;
  93        me.elem_len = strlen(name);
  94
  95        if (!match) {
  96                strbuf_addstr(base, name);
  97                if (base->len)
  98                        strbuf_addch(base, '/');
  99        }
 100
 101        init_tree_desc(&desc, tree->buffer, tree->size);
 102
 103        while (tree_entry(&desc, &entry)) {
 104                if (match != all_entries_interesting) {
 105                        match = tree_entry_interesting(&entry, base, 0,
 106                                                       &revs->diffopt.pathspec);
 107                        if (match == all_entries_not_interesting)
 108                                break;
 109                        if (match == entry_not_interesting)
 110                                continue;
 111                }
 112
 113                if (S_ISDIR(entry.mode))
 114                        process_tree(revs,
 115                                     lookup_tree(entry.sha1),
 116                                     show, &me, base, entry.path,
 117                                     cb_data);
 118                else if (S_ISGITLINK(entry.mode))
 119                        process_gitlink(revs, entry.sha1,
 120                                        show, &me, entry.path,
 121                                        cb_data);
 122                else
 123                        process_blob(revs,
 124                                     lookup_blob(entry.sha1),
 125                                     show, &me, entry.path,
 126                                     cb_data);
 127        }
 128        strbuf_setlen(base, baselen);
 129        free_tree_buffer(tree);
 130}
 131
 132static void mark_edge_parents_uninteresting(struct commit *commit,
 133                                            struct rev_info *revs,
 134                                            show_edge_fn show_edge)
 135{
 136        struct commit_list *parents;
 137
 138        for (parents = commit->parents; parents; parents = parents->next) {
 139                struct commit *parent = parents->item;
 140                if (!(parent->object.flags & UNINTERESTING))
 141                        continue;
 142                mark_tree_uninteresting(parent->tree);
 143                if (revs->edge_hint && !(parent->object.flags & SHOWN)) {
 144                        parent->object.flags |= SHOWN;
 145                        show_edge(parent);
 146                }
 147        }
 148}
 149
 150void mark_edges_uninteresting(struct rev_info *revs, show_edge_fn show_edge)
 151{
 152        struct commit_list *list;
 153        int i;
 154
 155        for (list = revs->commits; list; list = list->next) {
 156                struct commit *commit = list->item;
 157
 158                if (commit->object.flags & UNINTERESTING) {
 159                        mark_tree_uninteresting(commit->tree);
 160                        if (revs->edge_hint_aggressive && !(commit->object.flags & SHOWN)) {
 161                                commit->object.flags |= SHOWN;
 162                                show_edge(commit);
 163                        }
 164                        continue;
 165                }
 166                mark_edge_parents_uninteresting(commit, revs, show_edge);
 167        }
 168        if (revs->edge_hint_aggressive) {
 169                for (i = 0; i < revs->cmdline.nr; i++) {
 170                        struct object *obj = revs->cmdline.rev[i].item;
 171                        struct commit *commit = (struct commit *)obj;
 172                        if (obj->type != OBJ_COMMIT || !(obj->flags & UNINTERESTING))
 173                                continue;
 174                        mark_tree_uninteresting(commit->tree);
 175                        if (!(obj->flags & SHOWN)) {
 176                                obj->flags |= SHOWN;
 177                                show_edge(commit);
 178                        }
 179                }
 180        }
 181}
 182
 183static void add_pending_tree(struct rev_info *revs, struct tree *tree)
 184{
 185        add_pending_object(revs, &tree->object, "");
 186}
 187
 188void traverse_commit_list(struct rev_info *revs,
 189                          show_commit_fn show_commit,
 190                          show_object_fn show_object,
 191                          void *data)
 192{
 193        int i;
 194        struct commit *commit;
 195        struct strbuf base;
 196
 197        strbuf_init(&base, PATH_MAX);
 198        while ((commit = get_revision(revs)) != NULL) {
 199                /*
 200                 * an uninteresting boundary commit may not have its tree
 201                 * parsed yet, but we are not going to show them anyway
 202                 */
 203                if (commit->tree)
 204                        add_pending_tree(revs, commit->tree);
 205                show_commit(commit, data);
 206        }
 207        for (i = 0; i < revs->pending.nr; i++) {
 208                struct object_array_entry *pending = revs->pending.objects + i;
 209                struct object *obj = pending->item;
 210                const char *name = pending->name;
 211                const char *path = pending->path;
 212                if (obj->flags & (UNINTERESTING | SEEN))
 213                        continue;
 214                if (obj->type == OBJ_TAG) {
 215                        obj->flags |= SEEN;
 216                        show_object(obj, NULL, name, data);
 217                        continue;
 218                }
 219                if (!path)
 220                        path = "";
 221                if (obj->type == OBJ_TREE) {
 222                        process_tree(revs, (struct tree *)obj, show_object,
 223                                     NULL, &base, path, data);
 224                        continue;
 225                }
 226                if (obj->type == OBJ_BLOB) {
 227                        process_blob(revs, (struct blob *)obj, show_object,
 228                                     NULL, path, data);
 229                        continue;
 230                }
 231                die("unknown pending object %s (%s)",
 232                    sha1_to_hex(obj->sha1), name);
 233        }
 234        object_array_clear(&revs->pending);
 235        strbuf_release(&base);
 236}