#include "object.h"
#include "tree.h"
+#include "cache-tree.h"
++#include "tree-walk.h"
#include <sys/time.h>
#include <signal.h>
+ #include "builtin.h"
static int reset = 0;
static int merge = 0;
return deleted;
}
- struct tree_entry_list *ent;
- int cnt;
+static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
+{
- for (cnt = 0, ent = tree->entries; ent; ent = ent->next) {
- if (!ent->directory)
++ struct tree_desc desc;
++ int cnt = 0;
+
+ memcpy(it->sha1, tree->object.sha1, 20);
- struct tree *subtree = (struct tree *)ent->item.tree;
++ desc.buf = tree->buffer;
++ desc.size = tree->size;
++
++ while (desc.size) {
++ unsigned mode;
++ const char *name;
++ const unsigned char *sha1;
++
++ sha1 = tree_entry_extract(&desc, &name, &mode);
++ update_tree_entry(&desc);
++
++ if (!S_ISDIR(mode))
+ cnt++;
+ else {
+ struct cache_tree_sub *sub;
- sub = cache_tree_sub(it, ent->name);
++ struct tree *subtree;
++
++ subtree = lookup_tree(sha1);
+ if (!subtree->object.parsed)
+ parse_tree(subtree);
++ sub = cache_tree_sub(it, name);
+ sub->cache_tree = cache_tree();
+ prime_cache_tree_rec(sub->cache_tree, subtree);
+ cnt += sub->cache_tree->entry_count;
+ }
+ }
+ it->entry_count = cnt;
+}
+
+static void prime_cache_tree(void)
+{
+ struct tree *tree = (struct tree *)trees->item;
+ if (!tree)
+ return;
+ active_cache_tree = cache_tree();
+ prime_cache_tree_rec(active_cache_tree, tree);
+
+}
+
static const char read_tree_usage[] = "git-read-tree (<sha> | -m [--aggressive] [-u | -i] <sha1> [<sha2> [<sha3>]])";
static struct cache_file cache_file;