thodg/libgit2/src/tree-cache.h

• Show log

  Commit

• Hash : 19c88310
  Author :
  Date : 2014-07-10T13:48:13
  

  tree-cache: move to use a pool allocator This simplifies freeing the entries quite a bit; though there aren't that many failure paths right now, introducing filling the cache from a tree will introduce more. This makes sure not to leak memory on errors.

Download

• src/tree-cache.h

• /*
   * Copyright (C) the libgit2 contributors. All rights reserved.
   *
   * This file is part of libgit2, distributed under the GNU GPL v2 with
   * a Linking Exception. For full terms see the included COPYING file.
   */
  
  #ifndef INCLUDE_tree_cache_h__
  #define INCLUDE_tree_cache_h__
  
  #include "common.h"
  #include "pool.h"
  #include "git2/oid.h"
  
  typedef struct {
  	struct git_tree_cache *parent;
  	struct git_tree_cache **children;
  	size_t children_count;
  
  	ssize_t entries;
  	git_oid oid;
  	size_t namelen;
  	char name[GIT_FLEX_ARRAY];
  } git_tree_cache;
  
  int git_tree_cache_read(git_tree_cache **tree, const char *buffer, size_t buffer_size, git_pool *pool);
  void git_tree_cache_invalidate_path(git_tree_cache *tree, const char *path);
  const git_tree_cache *git_tree_cache_get(const git_tree_cache *tree, const char *path);
  int git_tree_cache_new(git_tree_cache **out, const char *name, git_tree_cache *parent, git_pool *pool);
  void git_tree_cache_free(git_tree_cache *tree);
  
  #endif
  

Download