summary |
shortlog |
log |
commit | commitdiff |
tree
raw |
patch |
inline | side by side (from parent 1:
0a2586c)
Signed-off-by: Junio C Hamano <junkio@cox.net>
#include "object.h"
#include "tree.h"
#include "object.h"
#include "tree.h"
#include <sys/time.h>
#include <signal.h>
#include "builtin.h"
#include <sys/time.h>
#include <signal.h>
#include "builtin.h"
static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
{
struct tree_desc desc;
static void prime_cache_tree_rec(struct cache_tree *it, struct tree *tree)
{
struct tree_desc desc;
memcpy(it->sha1, tree->object.sha1, 20);
desc.buf = tree->buffer;
desc.size = tree->size;
memcpy(it->sha1, tree->object.sha1, 20);
desc.buf = tree->buffer;
desc.size = tree->size;
while (desc.size) {
unsigned mode;
const char *name;
while (desc.size) {
unsigned mode;
const char *name;
sha1 = tree_entry_extract(&desc, &name, &mode);
update_tree_entry(&desc);
sha1 = tree_entry_extract(&desc, &name, &mode);
update_tree_entry(&desc);
if (!S_ISDIR(mode))
cnt++;
else {
struct cache_tree_sub *sub;
if (!S_ISDIR(mode))
cnt++;
else {
struct cache_tree_sub *sub;
- struct tree *subtree;
-
- subtree = lookup_tree(sha1);
+ struct tree *subtree = lookup_tree(sha1);
if (!subtree->object.parsed)
parse_tree(subtree);
sub = cache_tree_sub(it, name);
if (!subtree->object.parsed)
parse_tree(subtree);
sub = cache_tree_sub(it, name);