diff options
| author | graham.gower <graham.gower@e8e0d7a0-c8d9-11dd-a880-a1081c7ac358> | 2010-08-17 23:39:02 (EDT) |
|---|---|---|
| committer | graham.gower <graham.gower@e8e0d7a0-c8d9-11dd-a880-a1081c7ac358> | 2010-08-17 23:39:02 (EDT) |
| commit | 0a4946b3e913a2affe5fd342aa88e2533d06356e (patch) | |
| tree | a53f2e977e6d39ac8356a9664fa46bec26c31c85 /libopkg/active_list.c | |
| parent | 0eb2cb22be9a69e9562fea935617864cc0e5f217 (diff) | |
Remove trailing whitespace. Sorry if this breaks your patches.
git-svn-id: http://opkg.googlecode.com/svn/trunk@552 e8e0d7a0-c8d9-11dd-a880-a1081c7ac358
Diffstat (limited to 'libopkg/active_list.c')
| -rw-r--r-- | libopkg/active_list.c | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/libopkg/active_list.c b/libopkg/active_list.c index ffc6db0..69ac1d1 100644 --- a/libopkg/active_list.c +++ b/libopkg/active_list.c @@ -2,7 +2,7 @@ Tick Chen <tick@openmoko.com> - Copyright (C) 2008 Openmoko Inc. + Copyright (C) 2008 Openmoko Inc. This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as @@ -30,7 +30,7 @@ void active_list_init(struct active_list *ptr) { } /** - */ + */ struct active_list * active_list_next(struct active_list *head, struct active_list *ptr) { struct active_list *next=NULL; if ( !head ) { @@ -47,7 +47,7 @@ struct active_list * active_list_next(struct active_list *head, struct active_li return ptr->depended; } while ( next->depend.next != &next->depend ) { - next = list_entry(next->depend.next, struct active_list, node); + next = list_entry(next->depend.next, struct active_list, node); } return next; } @@ -64,10 +64,10 @@ struct active_list * active_list_prev(struct active_list *head, struct active_li if ( ptr->depend.prev != &ptr->depend ) { prev = list_entry(ptr->depend.prev, struct active_list, node); return prev; - } + } if ( ptr->depended && ptr->depended != head && &ptr->depended->depend == ptr->node.prev ) { prev = list_entry(ptr->depended->node.prev, struct active_list, node); - } else + } else prev = list_entry(ptr->node.prev, struct active_list, node); if ( prev == head ) return NULL; @@ -131,8 +131,8 @@ void active_list_head_delete(struct active_list *head) { } /* - * Using insert sort. - * Note. the list should not be large, or it will be very inefficient. + * Using insert sort. + * Note. the list should not be large, or it will be very inefficient. * */ struct active_list * active_list_sort(struct active_list *head, int (*compare)(const void *, const void *)) { |