Apple-2gs-SW/hush
1
0
Fork 0
mirror of https://github.com/sheumann/hush.git synced 2024-06-26 02:29:31 +00:00
Code Issues Projects Releases Wiki Activity

libbb: shrink linked list ops (by xmaks AT email.cz)

Browse Source 
function                                             old     new   delta
llist_pop                                             33      29      -4
llist_unlink                                          47      28     -19
llist_add_to_end                                      50      31     -19
------------------------------------------------------------------------------
(add/remove: 0/0 grow/shrink: 0/3 up/down: 0/-42)             Total: -42 bytes
This commit is contained in:
Denis Vlasenko 2009-01-13 15:22:50 +00:00
parent 35261159e6
commit 1265df1f31
1 changed files with 18 additions and 36 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

54
libbb/llist.c
View File

@ -25,56 +25,38 @@ void FAST_FUNC llist_add_to(llist_t **old_head, void *data)
/* Add data to the end of the linked list. */
void FAST_FUNC llist_add_to_end(llist_t **list_head, void *data)
{
llist_t *new_item = xmalloc(sizeof(llist_t));
new_item->data = data;
new_item->link = NULL;
if (!*list_head)
*list_head = new_item;
else {
llist_t *tail = *list_head;
while (tail->link)
tail = tail->link;
tail->link = new_item;
}
while (*list_head)
list_head = &(*list_head)->link;
*list_head = xzalloc(sizeof(llist_t));
(*list_head)->data = data;
/*(*list_head)->link = NULL;*/
}
/* Remove first element from the list and return it */
void* FAST_FUNC llist_pop(llist_t **head)
{
void *data, *next;
if (!*head)
return NULL;
data = (*head)->data;
next = (*head)->link;
free(*head);
*head = next;
void *data = NULL;
llist_t *temp = *head;
if (temp) {
data = temp->data;
*head = temp->link;
free(temp);
}
return data;
}
/* Unlink arbitrary given element from the list */
void FAST_FUNC llist_unlink(llist_t **head, llist_t *elm)
{
llist_t *crt;
if (!(elm && *head))
if (!elm)
return;
if (elm == *head) {
*head = (*head)->link;
return;
}
for (crt = *head; crt; crt = crt->link) {
if (crt->link == elm) {
crt->link = elm->link;
return;
while (*head) {
if (*head == elm) {
*head = (*head)->link;
break;
}
head = &(*head)->link;
}
}