aboutsummaryrefslogtreecommitdiff
path: root/libbb/llist.c
diff options
context:
space:
mode:
authorlandley <landley@69ca8d6d-28ef-0310-b511-8ec308f3f277>2006-03-06 20:47:33 +0000
committerlandley <landley@69ca8d6d-28ef-0310-b511-8ec308f3f277>2006-03-06 20:47:33 +0000
commit65d898209f1063e88397d8b1411d3b9df3f797ee (patch)
tree588d140a71e857cb32c80d1faad6f3073b119aa7 /libbb/llist.c
parent2cb5ca3cd6461e4e9632f53b4cece1ade0282580 (diff)
downloadbusybox-w32-65d898209f1063e88397d8b1411d3b9df3f797ee.tar.gz
busybox-w32-65d898209f1063e88397d8b1411d3b9df3f797ee.tar.bz2
busybox-w32-65d898209f1063e88397d8b1411d3b9df3f797ee.zip
Robert P. Day removed 8 gazillion occurrences of "extern" on function
definitions. (That should only be on prototypes.) git-svn-id: svn://busybox.net/trunk/busybox@14457 69ca8d6d-28ef-0310-b511-8ec308f3f277
Diffstat (limited to 'libbb/llist.c')
-rw-r--r--libbb/llist.c8
1 files changed, 4 insertions, 4 deletions
diff --git a/libbb/llist.c b/libbb/llist.c
index ce7daddee..af0a9948c 100644
--- a/libbb/llist.c
+++ b/libbb/llist.c
@@ -13,7 +13,7 @@
13 13
14#ifdef L_llist_add_to 14#ifdef L_llist_add_to
15/* Add data to the start of the linked list. */ 15/* Add data to the start of the linked list. */
16extern llist_t *llist_add_to(llist_t *old_head, char *new_item) 16llist_t *llist_add_to(llist_t *old_head, char *new_item)
17{ 17{
18 llist_t *new_head; 18 llist_t *new_head;
19 19
@@ -27,7 +27,7 @@ extern llist_t *llist_add_to(llist_t *old_head, char *new_item)
27 27
28#ifdef L_llist_add_to_end 28#ifdef L_llist_add_to_end
29/* Add data to the end of the linked list. */ 29/* Add data to the end of the linked list. */
30extern llist_t *llist_add_to_end(llist_t *list_head, char *data) 30llist_t *llist_add_to_end(llist_t *list_head, char *data)
31{ 31{
32 llist_t *new_item; 32 llist_t *new_item;
33 33
@@ -50,7 +50,7 @@ extern llist_t *llist_add_to_end(llist_t *list_head, char *data)
50#ifdef L_llist_free_one 50#ifdef L_llist_free_one
51/* Free the current list element and advance to the next entry in the list. 51/* Free the current list element and advance to the next entry in the list.
52 * Returns a pointer to the next element. */ 52 * Returns a pointer to the next element. */
53extern llist_t *llist_free_one(llist_t *elm) 53llist_t *llist_free_one(llist_t *elm)
54{ 54{
55 llist_t *next = elm ? elm->link : NULL; 55 llist_t *next = elm ? elm->link : NULL;
56#if ENABLE_DMALLOC /* avoid warnings from dmalloc's error-free-null option */ 56#if ENABLE_DMALLOC /* avoid warnings from dmalloc's error-free-null option */
@@ -64,7 +64,7 @@ extern llist_t *llist_free_one(llist_t *elm)
64 64
65#ifdef L_llist_free 65#ifdef L_llist_free
66/* Recursively free all elements in the linked list. */ 66/* Recursively free all elements in the linked list. */
67extern void llist_free(llist_t *elm) 67void llist_free(llist_t *elm)
68{ 68{
69 while ((elm = llist_free_one(elm))); 69 while ((elm = llist_free_one(elm)));
70} 70}