thodg/libgit2/tests/core/oidmap.c

• Show log

  Commit

• Hash : 351eeff3
  Author :
  Date : 2019-01-23T10:42:46
  

  maps: use uniform lifecycle management functions
  
  Currently, the lifecycle functions for maps (allocation, deallocation, resize)
  are not named in a uniform way and do not have a uniform function signature.
  Rename the functions to fix that, and stick to libgit2's naming scheme of saying
  `git_foo_new`. This results in the following new interface for allocation:
  
  - `int git_<t>map_new(git_<t>map **out)` to allocate a new map, returning an
    error code if we ran out of memory
  
  - `void git_<t>map_free(git_<t>map *map)` to free a map
  
  - `void git_<t>map_clear(git<t>map *map)` to remove all entries from a map
  
  This commit also fixes all existing callers.
  

Download

• tests/core/oidmap.c

• #include "clar_libgit2.h"
  #include "oidmap.h"
  
  typedef struct {
  	git_oid oid;
  	size_t extra;
  } oidmap_item;
  
  #define NITEMS 0x0fff
  
  void test_core_oidmap__basic(void)
  {
  	git_oidmap *map;
  	oidmap_item items[NITEMS];
  	uint32_t i, j;
  
  	for (i = 0; i < NITEMS; ++i) {
  		items[i].extra = i;
  		for (j = 0; j < GIT_OID_RAWSZ / 4; ++j) {
  			items[i].oid.id[j * 4    ] = (unsigned char)i;
  			items[i].oid.id[j * 4 + 1] = (unsigned char)(i >> 8);
  			items[i].oid.id[j * 4 + 2] = (unsigned char)(i >> 16);
  			items[i].oid.id[j * 4 + 3] = (unsigned char)(i >> 24);
  		}
  	}
  
  	cl_git_pass(git_oidmap_new(&map));
  
  	for (i = 0; i < NITEMS; ++i) {
  		size_t pos;
  		int ret;
  
  		pos = git_oidmap_lookup_index(map, &items[i].oid);
  		cl_assert(!git_oidmap_valid_index(map, pos));
  
  		pos = git_oidmap_put(map, &items[i].oid, &ret);
  		cl_assert(ret != 0);
  
  		git_oidmap_set_value_at(map, pos, &items[i]);
  	}
  
  
  	for (i = 0; i < NITEMS; ++i) {
  		size_t pos;
  
  		pos = git_oidmap_lookup_index(map, &items[i].oid);
  		cl_assert(git_oidmap_valid_index(map, pos));
  
  		cl_assert_equal_p(git_oidmap_value_at(map, pos), &items[i]);
  	}
  
  	git_oidmap_free(map);
  }
  
  void test_core_oidmap__hash_collision(void)
  {
  	git_oidmap *map;
  	oidmap_item items[NITEMS];
  	uint32_t i, j;
  
  	for (i = 0; i < NITEMS; ++i) {
  		uint32_t segment = i / 8;
  		int modi = i - (segment * 8);
  
  		items[i].extra = i;
  
  		for (j = 0; j < GIT_OID_RAWSZ / 4; ++j) {
  			items[i].oid.id[j * 4    ] = (unsigned char)modi;
  			items[i].oid.id[j * 4 + 1] = (unsigned char)(modi >> 8);
  			items[i].oid.id[j * 4 + 2] = (unsigned char)(modi >> 16);
  			items[i].oid.id[j * 4 + 3] = (unsigned char)(modi >> 24);
  		}
  
  		items[i].oid.id[ 8] = (unsigned char)i;
  		items[i].oid.id[ 9] = (unsigned char)(i >> 8);
  		items[i].oid.id[10] = (unsigned char)(i >> 16);
  		items[i].oid.id[11] = (unsigned char)(i >> 24);
  	}
  
  	cl_git_pass(git_oidmap_new(&map));
  
  	for (i = 0; i < NITEMS; ++i) {
  		size_t pos;
  		int ret;
  
  		pos = git_oidmap_lookup_index(map, &items[i].oid);
  		cl_assert(!git_oidmap_valid_index(map, pos));
  
  		pos = git_oidmap_put(map, &items[i].oid, &ret);
  		cl_assert(ret != 0);
  
  		git_oidmap_set_value_at(map, pos, &items[i]);
  	}
  
  
  	for (i = 0; i < NITEMS; ++i) {
  		size_t pos;
  
  		pos = git_oidmap_lookup_index(map, &items[i].oid);
  		cl_assert(git_oidmap_valid_index(map, pos));
  
  		cl_assert_equal_p(git_oidmap_value_at(map, pos), &items[i]);
  	}
  
  	git_oidmap_free(map);
  }
  

Download