-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Extract helper bits from c-merge-recursive work
This backports the pieces that are not uncooked from the merge-recursive WIP we have seen earlier, to be used in git-mv rewritten in C. Signed-off-by: Junio C Hamano <junkio@cox.net>
- Loading branch information
Johannes Schindelin
authored and
Junio C Hamano
committed
Jul 26, 2006
1 parent
24cf6e5
commit 8fd2cb4
Showing
4 changed files
with
172 additions
and
45 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,105 @@ | ||
#include <stdio.h> | ||
#include "cache.h" | ||
#include "path-list.h" | ||
|
||
/* if there is no exact match, point to the index where the entry could be | ||
* inserted */ | ||
static int get_entry_index(const struct path_list *list, const char *path, | ||
int *exact_match) | ||
{ | ||
int left = -1, right = list->nr; | ||
|
||
while (left + 1 < right) { | ||
int middle = (left + right) / 2; | ||
int compare = strcmp(path, list->items[middle].path); | ||
if (compare < 0) | ||
right = middle; | ||
else if (compare > 0) | ||
left = middle; | ||
else { | ||
*exact_match = 1; | ||
return middle; | ||
} | ||
} | ||
|
||
*exact_match = 0; | ||
return right; | ||
} | ||
|
||
/* returns -1-index if already exists */ | ||
static int add_entry(struct path_list *list, const char *path) | ||
{ | ||
int exact_match; | ||
int index = get_entry_index(list, path, &exact_match); | ||
|
||
if (exact_match) | ||
return -1 - index; | ||
|
||
if (list->nr + 1 >= list->alloc) { | ||
list->alloc += 32; | ||
list->items = xrealloc(list->items, list->alloc | ||
* sizeof(struct path_list_item)); | ||
} | ||
if (index < list->nr) | ||
memmove(list->items + index + 1, list->items + index, | ||
(list->nr - index) | ||
* sizeof(struct path_list_item)); | ||
list->items[index].path = list->strdup_paths ? | ||
strdup(path) : (char *)path; | ||
list->items[index].util = NULL; | ||
list->nr++; | ||
|
||
return index; | ||
} | ||
|
||
struct path_list_item *path_list_insert(const char *path, struct path_list *list) | ||
{ | ||
int index = add_entry(list, path); | ||
|
||
if (index < 0) | ||
index = 1 - index; | ||
|
||
return list->items + index; | ||
} | ||
|
||
int path_list_has_path(const struct path_list *list, const char *path) | ||
{ | ||
int exact_match; | ||
get_entry_index(list, path, &exact_match); | ||
return exact_match; | ||
} | ||
|
||
struct path_list_item *path_list_lookup(const char *path, struct path_list *list) | ||
{ | ||
int exact_match, i = get_entry_index(list, path, &exact_match); | ||
if (!exact_match) | ||
return NULL; | ||
return list->items + i; | ||
} | ||
|
||
void path_list_clear(struct path_list *list, int free_items) | ||
{ | ||
if (list->items) { | ||
int i; | ||
if (free_items) | ||
for (i = 0; i < list->nr; i++) { | ||
if (list->strdup_paths) | ||
free(list->items[i].path); | ||
if (list->items[i].util) | ||
free(list->items[i].util); | ||
} | ||
free(list->items); | ||
} | ||
list->items = NULL; | ||
list->nr = list->alloc = 0; | ||
} | ||
|
||
void print_path_list(const char *text, const struct path_list *p) | ||
{ | ||
int i; | ||
if ( text ) | ||
printf("%s\n", text); | ||
for (i = 0; i < p->nr; i++) | ||
printf("%s:%p\n", p->items[i].path, p->items[i].util); | ||
} | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,22 @@ | ||
#ifndef _PATH_LIST_H_ | ||
#define _PATH_LIST_H_ | ||
|
||
struct path_list_item { | ||
char *path; | ||
void *util; | ||
}; | ||
struct path_list | ||
{ | ||
struct path_list_item *items; | ||
unsigned int nr, alloc; | ||
unsigned int strdup_paths:1; | ||
}; | ||
|
||
void print_path_list(const char *text, const struct path_list *p); | ||
|
||
int path_list_has_path(const struct path_list *list, const char *path); | ||
void path_list_clear(struct path_list *list, int free_items); | ||
struct path_list_item *path_list_insert(const char *path, struct path_list *list); | ||
struct path_list_item *path_list_lookup(const char *path, struct path_list *list); | ||
|
||
#endif /* _PATH_LIST_H_ */ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters