The 5th batch

[thirdparty/git.git] / tree.h

#ifndef TREE_H
#define TREE_H

#include "object.h"

struct pathspec;
struct repository;
struct strbuf;

struct tree {
	struct object object;
	void *buffer;
	unsigned long size;
};

extern const char *tree_type;

struct tree *lookup_tree(struct repository *r, const struct object_id *oid);

int parse_tree_buffer(struct tree *item, void *buffer, unsigned long size);

#define parse_tree_gently(t, q) repo_parse_tree_gently(the_repository, t, q)
int repo_parse_tree_gently(struct repository *r, struct tree *item,
			   int quiet_on_missing);
#define parse_tree(t) repo_parse_tree(the_repository, t)
static inline int repo_parse_tree(struct repository *r, struct tree *item)
{
	return repo_parse_tree_gently(r, item, 0);
}
void free_tree_buffer(struct tree *tree);

/* Parses and returns the tree in the given ent, chasing tags and commits. */
#define parse_tree_indirect(o) repo_parse_tree_indirect(the_repository, o)
struct tree *repo_parse_tree_indirect(struct repository *r,
				      const struct object_id *oid);

/*
 * Functions for comparing pathnames
 */
int base_name_compare(const char *name1, size_t len1, int mode1,
		      const char *name2, size_t len2, int mode2);
int df_name_compare(const char *name1, size_t len1, int mode1,
		    const char *name2, size_t len2, int mode2);
int name_compare(const char *name1, size_t len1,
		 const char *name2, size_t len2);

#define READ_TREE_RECURSIVE 1
typedef int (*read_tree_fn_t)(const struct object_id *, struct strbuf *, const char *, unsigned int, void *);

int read_tree_at(struct repository *r,
		 struct tree *tree, struct strbuf *base,
		 int depth,
		 const struct pathspec *pathspec,
		 read_tree_fn_t fn, void *context);

int read_tree(struct repository *r,
	      struct tree *tree,
	      const struct pathspec *pathspec,
	      read_tree_fn_t fn, void *context);

#endif /* TREE_H */