cache-tree.hon commit fetch and pull: learn --progress (9839018)
   1#ifndef CACHE_TREE_H
   2#define CACHE_TREE_H
   3
   4#include "tree.h"
   5#include "tree-walk.h"
   6
   7struct cache_tree;
   8struct cache_tree_sub {
   9        struct cache_tree *cache_tree;
  10        int namelen;
  11        int used;
  12        char name[FLEX_ARRAY];
  13};
  14
  15struct cache_tree {
  16        int entry_count; /* negative means "invalid" */
  17        unsigned char sha1[20];
  18        int subtree_nr;
  19        int subtree_alloc;
  20        struct cache_tree_sub **down;
  21};
  22
  23struct cache_tree *cache_tree(void);
  24void cache_tree_free(struct cache_tree **);
  25void cache_tree_invalidate_path(struct cache_tree *, const char *);
  26struct cache_tree_sub *cache_tree_sub(struct cache_tree *, const char *);
  27
  28void cache_tree_write(struct strbuf *, struct cache_tree *root);
  29struct cache_tree *cache_tree_read(const char *buffer, unsigned long size);
  30
  31int cache_tree_fully_valid(struct cache_tree *);
  32int cache_tree_update(struct cache_tree *, struct cache_entry **, int, int, int);
  33
  34/* bitmasks to write_cache_as_tree flags */
  35#define WRITE_TREE_MISSING_OK 1
  36#define WRITE_TREE_IGNORE_CACHE_TREE 2
  37
  38/* error return codes */
  39#define WRITE_TREE_UNREADABLE_INDEX (-1)
  40#define WRITE_TREE_UNMERGED_INDEX (-2)
  41#define WRITE_TREE_PREFIX_ERROR (-3)
  42
  43int write_cache_as_tree(unsigned char *sha1, int flags, const char *prefix);
  44void prime_cache_tree(struct cache_tree **, struct tree *);
  45
  46extern int cache_tree_matches_traversal(struct cache_tree *, struct name_entry *ent, struct traverse_info *info);
  47
  48#endif