tree.c

   1 #include "cache.h"
   2 #include "tree.h"
   3 #include "blob.h"
   4 #include "commit.h"
   5 #include "tag.h"
   6 #include <stdlib.h>
   7
   8 const char *tree_type = "tree";
   9
  10 static int read_one_entry(unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage)
  11 {
  12         int len;
  13         unsigned int size;
  14         struct cache_entry *ce;
  15
  16         if (S_ISDIR(mode))
  17                 return READ_TREE_RECURSIVE;
  18
  19         len = strlen(pathname);
  20         size = cache_entry_size(baselen + len);
  21         ce = xcalloc(1, size);
  22
  23         ce->ce_mode = create_ce_mode(mode);
  24         ce->ce_flags = create_ce_flags(baselen + len, stage);
  25         memcpy(ce->name, base, baselen);
  26         memcpy(ce->name + baselen, pathname, len+1);
  27         memcpy(ce->sha1, sha1, 20);
  28         return add_cache_entry(ce, ADD_CACHE_OK_TO_ADD|ADD_CACHE_SKIP_DFCHECK);
  29 }
  30
  31 static int match_tree_entry(const char *base, int baselen, const char *path, unsigned int mode, const char **paths)
  32 {
  33         const char *match;
  34         int pathlen;
  35
  36         if (!paths)
  37                 return 1;
  38         pathlen = strlen(path);
  39         while ((match = *paths++) != NULL) {
  40                 int matchlen = strlen(match);
  41
  42                 if (baselen >= matchlen) {
  43                         /* If it doesn't match, move along... */
  44                         if (strncmp(base, match, matchlen))
  45                                 continue;
  46                         /* The base is a subdirectory of a path which was specified. */
  47                         return 1;
  48                 }
  49
  50                 /* Does the base match? */
  51                 if (strncmp(base, match, baselen))
  52                         continue;
  53
  54                 match += baselen;
  55                 matchlen -= baselen;
  56
  57                 if (pathlen > matchlen)
  58                         continue;
  59
  60                 if (matchlen > pathlen) {
  61                         if (match[pathlen] != '/')
  62                                 continue;
  63                         if (!S_ISDIR(mode))
  64                                 continue;
  65                 }
  66
  67                 if (strncmp(path, match, pathlen))
  68                         continue;
  69
  70                 return 1;
  71         }
  72         return 0;
  73 }
  74
  75 int read_tree_recursive(struct tree *tree,
  76                         const char *base, int baselen,
  77                         int stage, const char **match,
  78                         read_tree_fn_t fn)
  79 {
  80         struct tree_entry_list *list;
  81         if (parse_tree(tree))
  82                 return -1;
  83         list = tree->entries;
  84         while (list) {
  85                 struct tree_entry_list *current = list;
  86                 list = list->next;
  87                 if (!match_tree_entry(base, baselen, current->name,
  88                                       current->mode, match))
  89                         continue;
  90
  91                 switch (fn(current->item.any->sha1, base, baselen,
  92                            current->name, current->mode, stage)) {
  93                 case 0:
  94                         continue;
  95                 case READ_TREE_RECURSIVE:
  96                         break;;
  97                 default:
  98                         return -1;
  99                 }
 100                 if (current->directory) {
 101                         int retval;
 102                         int pathlen = strlen(current->name);
 103                         char *newbase;
 104
 105                         newbase = xmalloc(baselen + 1 + pathlen);
 106                         memcpy(newbase, base, baselen);
 107                         memcpy(newbase + baselen, current->name, pathlen);
 108                         newbase[baselen + pathlen] = '/';
 109                         retval = read_tree_recursive(current->item.tree,
 110                                                      newbase,
 111                                                      baselen + pathlen + 1,
 112                                                      stage, match, fn);
 113                         free(newbase);
 114                         if (retval)
 115                                 return -1;
 116                         continue;
 117                 }
 118         }
 119         return 0;
 120 }
 121
 122 int read_tree(struct tree *tree, int stage, const char **match)
 123 {
 124         return read_tree_recursive(tree, "", 0, stage, match, read_one_entry);
 125 }
 126
 127 struct tree *lookup_tree(const unsigned char *sha1)
 128 {
 129         struct object *obj = lookup_object(sha1);
 130         if (!obj) {
 131                 struct tree *ret = xcalloc(1, sizeof(struct tree));
 132                 created_object(sha1, &ret->object);
 133                 ret->object.type = tree_type;
 134                 return ret;
 135         }
 136         if (!obj->type)
 137                 obj->type = tree_type;
 138         if (obj->type != tree_type) {
 139                 error("Object %s is a %s, not a tree",
 140                       sha1_to_hex(sha1), obj->type);
 141                 return NULL;
 142         }
 143         return (struct tree *) obj;
 144 }
 145
 146 int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size)
 147 {
 148         void *bufptr = buffer;
 149         struct tree_entry_list **list_p;
 150         int n_refs = 0;
 151
 152         if (item->object.parsed)
 153                 return 0;
 154         item->object.parsed = 1;
 155         list_p = &item->entries;
 156         while (size) {
 157                 struct object *obj;
 158                 struct tree_entry_list *entry;
 159                 int len = 1+strlen(bufptr);
 160                 unsigned char *file_sha1 = bufptr + len;
 161                 char *path = strchr(bufptr, ' ');
 162                 unsigned int mode;
 163                 if (size < len + 20 || !path ||
 164                     sscanf(bufptr, "%o", &mode) != 1)
 165                         return -1;
 166
 167                 entry = xmalloc(sizeof(struct tree_entry_list));
 168                 entry->name = strdup(path + 1);
 169                 entry->directory = S_ISDIR(mode) != 0;
 170                 entry->executable = (mode & S_IXUSR) != 0;
 171                 entry->symlink = S_ISLNK(mode) != 0;
 172                 entry->zeropad = *(char *)bufptr == '0';
 173                 entry->mode = mode;
 174                 entry->next = NULL;
 175
 176                 bufptr += len + 20;
 177                 size -= len + 20;
 178
 179                 if (entry->directory) {
 180                         entry->item.tree = lookup_tree(file_sha1);
 181                         obj = &entry->item.tree->object;
 182                 } else {
 183                         entry->item.blob = lookup_blob(file_sha1);
 184                         obj = &entry->item.blob->object;
 185                 }
 186                 if (obj)
 187                         n_refs++;
 188                 *list_p = entry;
 189                 list_p = &entry->next;
 190         }
 191
 192         if (track_object_refs) {
 193                 struct tree_entry_list *entry;
 194                 unsigned i = 0;
 195                 struct object_refs *refs = alloc_object_refs(n_refs);
 196                 for (entry = item->entries; entry; entry = entry->next)
 197                         refs->ref[i++] = entry->item.any;
 198                 set_object_refs(&item->object, refs);
 199         }
 200
 201         return 0;
 202 }
 203
 204 int parse_tree(struct tree *item)
 205 {
 206          char type[20];
 207          void *buffer;
 208          unsigned long size;
 209          int ret;
 210
 211         if (item->object.parsed)
 212                 return 0;
 213         buffer = read_sha1_file(item->object.sha1, type, &size);
 214         if (!buffer)
 215                 return error("Could not read %s",
 216                              sha1_to_hex(item->object.sha1));
 217         if (strcmp(type, tree_type)) {
 218                 free(buffer);
 219                 return error("Object %s not a tree",
 220                              sha1_to_hex(item->object.sha1));
 221         }
 222         ret = parse_tree_buffer(item, buffer, size);
 223         free(buffer);
 224         return ret;
 225 }
 226
 227 struct tree *parse_tree_indirect(const unsigned char *sha1)
 228 {
 229         struct object *obj = parse_object(sha1);
 230         do {
 231                 if (!obj)
 232                         return NULL;
 233                 if (obj->type == tree_type)
 234                         return (struct tree *) obj;
 235                 else if (obj->type == commit_type)
 236                         obj = &(((struct commit *) obj)->tree->object);
 237                 else if (obj->type == tag_type)
 238                         obj = ((struct tag *) obj)->tagged;
 239                 else
 240                         return NULL;
 241                 if (!obj->parsed)
 242                         parse_object(obj->sha1);
 243         } while (1);
 244 }