cache-tree.h

   1 #ifndef CACHE_TREE_H
   2 #define CACHE_TREE_H
   3
   4 #include "tree.h"
   5 #include "tree-walk.h"
   6
   7 struct cache_tree;
   8 struct cache_tree_sub {
   9         struct cache_tree *cache_tree;
  10         int count;              /* internally used by update_one() */
  11         int namelen;
  12         int used;
  13         char name[FLEX_ARRAY];
  14 };
  15
  16 struct cache_tree {
  17         int entry_count; /* negative means "invalid" */
  18         struct object_id oid;
  19         int subtree_nr;
  20         int subtree_alloc;
  21         struct cache_tree_sub **down;
  22 };
  23
  24 struct cache_tree *cache_tree(void);
  25 void cache_tree_free(struct cache_tree **);
  26 void cache_tree_invalidate_path(struct index_state *, const char *);
  27 struct cache_tree_sub *cache_tree_sub(struct cache_tree *, const char *);
  28
  29 int cache_tree_subtree_pos(struct cache_tree *it, const char *path, int pathlen);
  30
  31 void cache_tree_write(struct strbuf *, struct cache_tree *root);
  32 struct cache_tree *cache_tree_read(const char *buffer, unsigned long size);
  33
  34 int cache_tree_fully_valid(struct cache_tree *);
  35 int cache_tree_update(struct index_state *, int);
  36 void cache_tree_verify(struct repository *, struct index_state *);
  37
  38 /* bitmasks to write_index_as_tree flags */
  39 #define WRITE_TREE_MISSING_OK 1
  40 #define WRITE_TREE_IGNORE_CACHE_TREE 2
  41 #define WRITE_TREE_DRY_RUN 4
  42 #define WRITE_TREE_SILENT 8
  43 #define WRITE_TREE_REPAIR 16
  44
  45 /* error return codes */
  46 #define WRITE_TREE_UNREADABLE_INDEX (-1)
  47 #define WRITE_TREE_UNMERGED_INDEX (-2)
  48 #define WRITE_TREE_PREFIX_ERROR (-3)
  49
  50 struct tree* write_in_core_index_as_tree(struct repository *repo);
  51 int write_index_as_tree(struct object_id *oid, struct index_state *index_state, const char *index_path, int flags, const char *prefix);
  52 void prime_cache_tree(struct repository *, struct index_state *, struct tree *);
  53
  54 int cache_tree_matches_traversal(struct cache_tree *, struct name_entry *ent, struct traverse_info *info);
  55 #endif