mirrors/git
0
0
Fork 0
mirror of https://github.com/git/git.git synced 2024-11-24 18:33:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

speedup allocation in pack-redundant.c

Browse Source 
Reuse discarded nodes of llists

Signed-off-by: Alex Riesen <ariesen@harmanbecker.com>
Signed-off-by: Junio C Hamano <junkio@cox.net>
This commit is contained in:
Alex Riesen 2005-11-22 15:56:35 +01:00 committed by Junio C Hamano
parent bb931cf9d7
commit 60435f68bb
1 changed files with 26 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

32
pack-redundant.c
View File

@ -36,11 +36,31 @@ struct pll {
size_t pl_size;
};
static inline void llist_free(struct llist *list)
static struct llist_item *free_nodes = NULL;
static inline struct llist_item *llist_item_get()
{
struct llist_item *new;
if ( free_nodes ) {
new = free_nodes;
free_nodes = free_nodes->next;
} else
new = xmalloc(sizeof(struct llist_item));
return new;
}
static inline void llist_item_put(struct llist_item *item)
{
item->next = free_nodes;
free_nodes = item;
}
static void llist_free(struct llist *list)
{
while((list->back = list->front)) {
list->front = list->front->next;
free(list->back);
llist_item_put(list->back);
}
free(list);
}
@ -62,13 +82,13 @@ static struct llist * llist_copy(struct llist *list)
if ((ret->size = list->size) == 0)
return ret;
new = ret->front = xmalloc(sizeof(struct llist_item));
new = ret->front = llist_item_get();
new->sha1 = list->front->sha1;
old = list->front->next;
while (old) {
prev = new;
new = xmalloc(sizeof(struct llist_item));
new = llist_item_get();
prev->next = new;
new->sha1 = old->sha1;
old = old->next;
@ -82,7 +102,7 @@ static struct llist * llist_copy(struct llist *list)
static inline struct llist_item * llist_insert(struct llist *list,
struct llist_item *after, char *sha1)
{
struct llist_item *new = xmalloc(sizeof(struct llist_item));
struct llist_item *new = llist_item_get();
new->sha1 = sha1;
new->next = NULL;
@ -153,7 +173,7 @@ redo_from_start:
prev->next = l->next;
if (l == list->back)
list->back = prev;
free(l);
llist_item_put(l);
list->size--;
return prev;
}