Hash :
3b2a423c
Author :
Date :
2011-07-09T00:08:52
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 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391
/*
* This file is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License, version 2,
* as published by the Free Software Foundation.
*
* In addition to the permissions in the GNU General Public License,
* the authors give you unlimited permission to link the compiled
* version of this file into combinations with other programs,
* and to distribute those combinations without any restriction
* coming from the use of this file. (The General Public License
* restrictions do apply in other respects; for example, they cover
* modification of the file, and distribution when not linked into
* a combined executable.)
*
* This file is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; see the file COPYING. If not, write to
* the Free Software Foundation, 51 Franklin Street, Fifth Floor,
* Boston, MA 02110-1301, USA.
*/
#include "common.h"
#include "git2.h"
#include "fileops.h"
#include "hash.h"
#include "vector.h"
#include "tree.h"
#include "git2/status.h"
int git_status_hashfile(git_oid *out, const char *path)
{
int fd, len;
char hdr[64], buffer[2048];
git_off_t size;
git_hash_ctx *ctx;
if ((fd = p_open(path, O_RDONLY)) < 0)
return git__throw(GIT_ENOTFOUND, "Could not open '%s'", path);
if ((size = git_futils_filesize(fd)) < 0 || !git__is_sizet(size)) {
p_close(fd);
return git__throw(GIT_EOSERR, "'%s' appears to be corrupted", path);
}
ctx = git_hash_new_ctx();
len = snprintf(hdr, sizeof(hdr), "blob %"PRIuZ, (size_t)size);
assert(len > 0);
assert(((size_t) len) < sizeof(hdr));
if (len < 0 || ((size_t) len) >= sizeof(hdr))
return git__throw(GIT_ERROR, "Failed to format blob header. Length is out of bounds");
git_hash_update(ctx, hdr, len+1);
while (size > 0) {
ssize_t read_len;
read_len = read(fd, buffer, sizeof(buffer));
if (read_len < 0) {
p_close(fd);
git_hash_free_ctx(ctx);
return git__throw(GIT_EOSERR, "Can't read full file '%s'", path);
}
git_hash_update(ctx, buffer, read_len);
size -= read_len;
}
p_close(fd);
git_hash_final(out, ctx);
git_hash_free_ctx(ctx);
return GIT_SUCCESS;
}
struct status_entry {
char path[GIT_PATH_MAX];
git_index_time mtime;
git_oid head_oid;
git_oid index_oid;
git_oid wt_oid;
unsigned int status_flags:6;
};
static int status_cmp(const void *a, const void *b)
{
const struct status_entry *entry_a = (const struct status_entry *)(a);
const struct status_entry *entry_b = (const struct status_entry *)(b);
return strcmp(entry_a->path, entry_b->path);
}
static int status_srch(const void *key, const void *array_member)
{
const char *path = (const char *)key;
const struct status_entry *entry = (const struct status_entry *)(array_member);
return strcmp(path, entry->path);
}
static int find_status_entry(git_vector *entries, const char *path)
{
git_vector_sort(entries);
return git_vector_bsearch2(entries, status_srch, path);
}
static struct status_entry *new_status_entry(git_vector *entries, const char *path)
{
struct status_entry *e = git__malloc(sizeof(struct status_entry));
memset(e, 0x0, sizeof(struct status_entry));
if (entries != NULL)
git_vector_insert(entries, e);
strcpy(e->path, path);
return e;
}
static void recurse_tree_entries(git_tree *tree, git_vector *entries, char *path)
{
int i, cnt, idx;
struct status_entry *e;
char file_path[GIT_PATH_MAX];
git_tree *subtree;
cnt = git_tree_entrycount(tree);
for (i = 0; i < cnt; ++i) {
const git_tree_entry *tree_entry = git_tree_entry_byindex(tree, i);
git_path_join(file_path, path, tree_entry->filename);
if (git_tree_lookup(&subtree, tree->object.repo, &tree_entry->oid) == GIT_SUCCESS) {
recurse_tree_entries(subtree, entries, file_path);
return;
}
if ((idx = find_status_entry(entries, file_path)) != GIT_ENOTFOUND)
e = (struct status_entry *)git_vector_get(entries, idx);
else
e = new_status_entry(entries, file_path);
git_oid_cpy(&e->head_oid, &tree_entry->oid);
}
git_tree_close(tree);
}
static void recurse_tree_entry(git_tree *tree, struct status_entry *e, const char *path)
{
char *dir_sep;
char buffer[GIT_PATH_MAX];
const git_tree_entry *tree_entry;
git_tree *subtree;
strcpy(buffer, path);
dir_sep = strchr(buffer, '/');
if (dir_sep) {
*dir_sep = '\0';
tree_entry = git_tree_entry_byname(tree, buffer);
if (tree_entry != NULL) {
if (git_tree_lookup(&subtree, tree->object.repo, &tree_entry->oid) == GIT_SUCCESS) {
recurse_tree_entry(subtree, e, dir_sep+1);
return;
}
}
}
tree_entry = git_tree_entry_byname(tree, path);
if (tree_entry != NULL) {
git_oid_cpy(&e->head_oid, &tree_entry->oid);
}
git_tree_close(tree);
}
static int workdir_path_len;
static int dirent_cb(void *state, char *full_path)
{
int idx;
struct status_entry *e;
git_vector *entries = (git_vector *)state;
char *file_path = full_path + workdir_path_len;
struct stat filest;
git_oid oid;
if ((git_futils_isdir(full_path) == GIT_SUCCESS) && (!strcmp(".git", file_path)))
return 0;
if (git_futils_isdir(full_path) == GIT_SUCCESS)
return git_futils_direach(full_path, GIT_PATH_MAX, dirent_cb, state);
if ((idx = find_status_entry(entries, file_path)) != GIT_ENOTFOUND) {
e = (struct status_entry *)git_vector_get(entries, idx);
if (p_stat(full_path, &filest) < 0)
return git__throw(GIT_EOSERR, "Failed to read file %s", full_path);
if (e->mtime.seconds == (git_time_t)filest.st_mtime) {
git_oid_cpy(&e->wt_oid, &e->index_oid);
return 0;
}
} else {
e = new_status_entry(entries, file_path);
}
git_status_hashfile(&oid, full_path);
git_oid_cpy(&e->wt_oid, &oid);
return 0;
}
static int single_dirent_cb(void *state, char *full_path)
{
struct status_entry *e = *(struct status_entry **)(state);
char *file_path = full_path + workdir_path_len;
struct stat filest;
git_oid oid;
if ((git_futils_isdir(full_path) == GIT_SUCCESS) && (!strcmp(".git", file_path)))
return 0;
if (git_futils_isdir(full_path) == GIT_SUCCESS)
return git_futils_direach(full_path, GIT_PATH_MAX, single_dirent_cb, state);
if (!strcmp(file_path, e->path)) {
if (p_stat(full_path, &filest) < 0)
return git__throw(GIT_EOSERR, "Failed to read file %s", full_path);
if (e->mtime.seconds == (git_time_t)filest.st_mtime) {
git_oid_cpy(&e->wt_oid, &e->index_oid);
return 1;
}
git_status_hashfile(&oid, full_path);
git_oid_cpy(&e->wt_oid, &oid);
return 1;
}
return 0;
}
static int set_status_flags(struct status_entry *e)
{
git_oid zero;
int head_zero, index_zero, wt_zero;
memset(&zero, 0x0, sizeof(git_oid));
head_zero = git_oid_cmp(&zero, &e->head_oid);
index_zero = git_oid_cmp(&zero, &e->index_oid);
wt_zero = git_oid_cmp(&zero, &e->wt_oid);
if (head_zero == 0 && index_zero == 0 && wt_zero == 0)
return GIT_ENOTFOUND;
if (head_zero == 0 && index_zero != 0)
e->status_flags |= GIT_STATUS_INDEX_NEW;
else if (index_zero == 0 && head_zero != 0)
e->status_flags |= GIT_STATUS_INDEX_DELETED;
else if (git_oid_cmp(&e->head_oid, &e->index_oid) != 0)
e->status_flags |= GIT_STATUS_INDEX_MODIFIED;
if (index_zero == 0 && wt_zero != 0)
e->status_flags |= GIT_STATUS_WT_NEW;
else if (wt_zero == 0 && index_zero != 0)
e->status_flags |= GIT_STATUS_WT_DELETED;
else if (git_oid_cmp(&e->index_oid, &e->wt_oid) != 0)
e->status_flags |= GIT_STATUS_WT_MODIFIED;
return GIT_SUCCESS;
}
int git_status_foreach(git_repository *repo, int (*callback)(const char *, unsigned int, void *), void *payload)
{
git_vector entries;
struct status_entry *e;
git_index *index;
unsigned int i, cnt;
git_index_entry *index_entry;
char temp_path[GIT_PATH_MAX];
git_oid zero;
int error;
git_tree *tree;
git_reference *head_ref, *resolved_head_ref;
git_commit *head_commit;
git_repository_index(&index, repo);
cnt = git_index_entrycount(index);
git_vector_init(&entries, cnt, status_cmp);
for (i = 0; i < cnt; ++i) {
index_entry = git_index_get(index, i);
e = new_status_entry(&entries, index_entry->path);
git_oid_cpy(&e->index_oid, &index_entry->oid);
e->mtime = index_entry->mtime;
}
git_reference_lookup(&head_ref, repo, GIT_HEAD_FILE);
git_reference_resolve(&resolved_head_ref, head_ref);
git_commit_lookup(&head_commit, repo, git_reference_oid(resolved_head_ref));
// recurse through tree entries
git_commit_tree(&tree, head_commit);
recurse_tree_entries(tree, &entries, "");
workdir_path_len = strlen(repo->path_workdir);
strcpy(temp_path, repo->path_workdir);
git_futils_direach(temp_path, GIT_PATH_MAX, dirent_cb, &entries);
memset(&zero, 0x0, sizeof(git_oid));
for (i = 0; i < entries.length; ++i) {
e = (struct status_entry *)git_vector_get(&entries, i);
set_status_flags(e);
}
for (i = 0; i < entries.length; ++i) {
e = (struct status_entry *)git_vector_get(&entries, i);
if ((error = callback(e->path, e->status_flags, payload)) < GIT_SUCCESS)
return git__throw(error, "Failed to list statuses. User callback failed");
}
for (i = 0; i < entries.length; ++i) {
e = (struct status_entry *)git_vector_get(&entries, i);
free(e);
}
git_vector_free(&entries);
return GIT_SUCCESS;
}
int git_status_file(unsigned int *status_flags, git_repository *repo, const char *path)
{
struct status_entry *e;
git_index *index;
git_index_entry *index_entry;
char temp_path[GIT_PATH_MAX];
int idx, error;
git_tree *tree;
git_reference *head_ref, *resolved_head_ref;
git_commit *head_commit;
assert(status_flags);
e = new_status_entry(NULL, path);
// Find file in Index
git_repository_index(&index, repo);
idx = git_index_find(index, path);
if (idx >= 0) {
index_entry = git_index_get(index, idx);
git_oid_cpy(&e->index_oid, &index_entry->oid);
e->mtime = index_entry->mtime;
}
// Find file in HEAD
git_reference_lookup(&head_ref, repo, GIT_HEAD_FILE);
git_reference_resolve(&resolved_head_ref, head_ref);
git_commit_lookup(&head_commit, repo, git_reference_oid(resolved_head_ref));
git_commit_tree(&tree, head_commit);
recurse_tree_entry(tree, e, path);
// Find file in Workdir
workdir_path_len = strlen(repo->path_workdir);
strcpy(temp_path, repo->path_workdir);
git_futils_direach(temp_path, GIT_PATH_MAX, single_dirent_cb, &e);
if ((error = set_status_flags(e)) < GIT_SUCCESS)
return git__throw(error, "Nonexistent file");
*status_flags = e->status_flags;
free(e);
return GIT_SUCCESS;
}