Tag
Hash :
c67fd4c9
Author :
Date :
2014-02-07T11:20:36
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276
#include "clar_libgit2.h"
#include "vector.h"
/* initial size of 1 would cause writing past array bounds */
void test_core_vector__0(void)
{
git_vector x;
int i;
git_vector_init(&x, 1, NULL);
for (i = 0; i < 10; ++i) {
git_vector_insert(&x, (void*) 0xabc);
}
git_vector_free(&x);
}
/* don't read past array bounds on remove() */
void test_core_vector__1(void)
{
git_vector x;
// make initial capacity exact for our insertions.
git_vector_init(&x, 3, NULL);
git_vector_insert(&x, (void*) 0xabc);
git_vector_insert(&x, (void*) 0xdef);
git_vector_insert(&x, (void*) 0x123);
git_vector_remove(&x, 0); // used to read past array bounds.
git_vector_free(&x);
}
static int test_cmp(const void *a, const void *b)
{
return *(const int *)a - *(const int *)b;
}
/* remove duplicates */
void test_core_vector__2(void)
{
git_vector x;
int *ptrs[2];
ptrs[0] = git__malloc(sizeof(int));
ptrs[1] = git__malloc(sizeof(int));
*ptrs[0] = 2;
*ptrs[1] = 1;
cl_git_pass(git_vector_init(&x, 5, test_cmp));
cl_git_pass(git_vector_insert(&x, ptrs[0]));
cl_git_pass(git_vector_insert(&x, ptrs[1]));
cl_git_pass(git_vector_insert(&x, ptrs[1]));
cl_git_pass(git_vector_insert(&x, ptrs[0]));
cl_git_pass(git_vector_insert(&x, ptrs[1]));
cl_assert(x.length == 5);
git_vector_uniq(&x, NULL);
cl_assert(x.length == 2);
git_vector_free(&x);
git__free(ptrs[0]);
git__free(ptrs[1]);
}
static int compare_them(const void *a, const void *b)
{
return (int)((long)a - (long)b);
}
/* insert_sorted */
void test_core_vector__3(void)
{
git_vector x;
long i;
git_vector_init(&x, 1, &compare_them);
for (i = 0; i < 10; i += 2) {
git_vector_insert_sorted(&x, (void*)(i + 1), NULL);
}
for (i = 9; i > 0; i -= 2) {
git_vector_insert_sorted(&x, (void*)(i + 1), NULL);
}
cl_assert(x.length == 10);
for (i = 0; i < 10; ++i) {
cl_assert(git_vector_get(&x, i) == (void*)(i + 1));
}
git_vector_free(&x);
}
/* insert_sorted with duplicates */
void test_core_vector__4(void)
{
git_vector x;
long i;
git_vector_init(&x, 1, &compare_them);
for (i = 0; i < 10; i += 2) {
git_vector_insert_sorted(&x, (void*)(i + 1), NULL);
}
for (i = 9; i > 0; i -= 2) {
git_vector_insert_sorted(&x, (void*)(i + 1), NULL);
}
for (i = 0; i < 10; i += 2) {
git_vector_insert_sorted(&x, (void*)(i + 1), NULL);
}
for (i = 9; i > 0; i -= 2) {
git_vector_insert_sorted(&x, (void*)(i + 1), NULL);
}
cl_assert(x.length == 20);
for (i = 0; i < 20; ++i) {
cl_assert(git_vector_get(&x, i) == (void*)(i / 2 + 1));
}
git_vector_free(&x);
}
typedef struct {
int content;
int count;
} my_struct;
static int _struct_count = 0;
static int compare_structs(const void *a, const void *b)
{
return ((const my_struct *)a)->content -
((const my_struct *)b)->content;
}
static int merge_structs(void **old_raw, void *new)
{
my_struct *old = *(my_struct **)old_raw;
cl_assert(((my_struct *)old)->content == ((my_struct *)new)->content);
((my_struct *)old)->count += 1;
git__free(new);
_struct_count--;
return GIT_EEXISTS;
}
static my_struct *alloc_struct(int value)
{
my_struct *st = git__malloc(sizeof(my_struct));
st->content = value;
st->count = 0;
_struct_count++;
return st;
}
/* insert_sorted with duplicates and special handling */
void test_core_vector__5(void)
{
git_vector x;
int i;
git_vector_init(&x, 1, &compare_structs);
for (i = 0; i < 10; i += 2)
git_vector_insert_sorted(&x, alloc_struct(i), &merge_structs);
for (i = 9; i > 0; i -= 2)
git_vector_insert_sorted(&x, alloc_struct(i), &merge_structs);
cl_assert(x.length == 10);
cl_assert(_struct_count == 10);
for (i = 0; i < 10; i += 2)
git_vector_insert_sorted(&x, alloc_struct(i), &merge_structs);
for (i = 9; i > 0; i -= 2)
git_vector_insert_sorted(&x, alloc_struct(i), &merge_structs);
cl_assert(x.length == 10);
cl_assert(_struct_count == 10);
for (i = 0; i < 10; ++i) {
cl_assert(((my_struct *)git_vector_get(&x, i))->content == i);
git__free(git_vector_get(&x, i));
_struct_count--;
}
git_vector_free(&x);
}
static int remove_ones(const git_vector *v, size_t idx, void *p)
{
GIT_UNUSED(p);
return (git_vector_get(v, idx) == (void *)0x001);
}
/* Test removal based on callback */
void test_core_vector__remove_matching(void)
{
git_vector x;
size_t i;
void *compare;
git_vector_init(&x, 1, NULL);
git_vector_insert(&x, (void*) 0x001);
cl_assert(x.length == 1);
git_vector_remove_matching(&x, remove_ones, NULL);
cl_assert(x.length == 0);
git_vector_insert(&x, (void*) 0x001);
git_vector_insert(&x, (void*) 0x001);
git_vector_insert(&x, (void*) 0x001);
cl_assert(x.length == 3);
git_vector_remove_matching(&x, remove_ones, NULL);
cl_assert(x.length == 0);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x001);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x001);
cl_assert(x.length == 4);
git_vector_remove_matching(&x, remove_ones, NULL);
cl_assert(x.length == 2);
git_vector_foreach(&x, i, compare) {
cl_assert(compare != (void *)0x001);
}
git_vector_clear(&x);
git_vector_insert(&x, (void*) 0x001);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x001);
cl_assert(x.length == 4);
git_vector_remove_matching(&x, remove_ones, NULL);
cl_assert(x.length == 2);
git_vector_foreach(&x, i, compare) {
cl_assert(compare != (void *)0x001);
}
git_vector_clear(&x);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x001);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x001);
cl_assert(x.length == 4);
git_vector_remove_matching(&x, remove_ones, NULL);
cl_assert(x.length == 2);
git_vector_foreach(&x, i, compare) {
cl_assert(compare != (void *)0x001);
}
git_vector_clear(&x);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x003);
git_vector_insert(&x, (void*) 0x002);
git_vector_insert(&x, (void*) 0x003);
cl_assert(x.length == 4);
git_vector_remove_matching(&x, remove_ones, NULL);
cl_assert(x.length == 4);
git_vector_free(&x);
}