summaryrefslogtreecommitdiff
path: root/shared/nm-std-aux/c-list-util.c
diff options
context:
space:
mode:
authorThomas Haller <thaller@redhat.com>2020-09-28 14:50:01 +0200
committerAntonio Cardace <acardace@redhat.com>2020-09-28 16:07:52 +0200
commit740b092fda3d5f45102422f22884c88ea6c42858 (patch)
tree5a049cc10c99efb5ee39606b8b1d0893a9f46db3 /shared/nm-std-aux/c-list-util.c
parent328fb90f3e0d4e35975aff63944ac0412d7893a5 (diff)
downloadNetworkManager-ac/clang-format.tar.gz
format: replace tabs for indentation in code commentsac/clang-format
sed -i \ -e 's/^'$'\t'' \*/ */g' \ -e 's/^'$'\t\t'' \*/ */g' \ -e 's/^'$'\t\t\t'' \*/ */g' \ -e 's/^'$'\t\t\t\t'' \*/ */g' \ -e 's/^'$'\t\t\t\t\t'' \*/ */g' \ -e 's/^'$'\t\t\t\t\t\t'' \*/ */g' \ -e 's/^'$'\t\t\t\t\t\t\t'' \*/ */g' \ $(git ls-files -- '*.[hc]')
Diffstat (limited to 'shared/nm-std-aux/c-list-util.c')
-rw-r--r--shared/nm-std-aux/c-list-util.c12
1 files changed, 6 insertions, 6 deletions
diff --git a/shared/nm-std-aux/c-list-util.c b/shared/nm-std-aux/c-list-util.c
index f298857154..f56347ccc3 100644
--- a/shared/nm-std-aux/c-list-util.c
+++ b/shared/nm-std-aux/c-list-util.c
@@ -71,8 +71,8 @@ _c_list_srt_merge(CList *ls1, CList *ls2, CListSortCmp cmp, const void *user_dat
ls = &head;
for (;;) {
/* while invoking the @cmp function, the list
- * elements are not properly linked. Don't try to access
- * their next/prev pointers. */
+ * elements are not properly linked. Don't try to access
+ * their next/prev pointers. */
if (cmp(ls1, ls2, user_data) <= 0) {
ls->next = ls1;
ls = ls1;
@@ -102,16 +102,16 @@ static CList *
_c_list_sort(CList *ls, CListSortCmp cmp, const void *user_data)
{
/* reserve a huge stack-size. We need roughly log2(n) entries, hence this
- * is much more we will ever need. We don't guard for stack-overflow either. */
+ * is much more we will ever need. We don't guard for stack-overflow either. */
SortStack stack_arr[70];
SortStack *stack_head = stack_arr;
stack_arr[0].ls1 = ls;
/* A simple top-down, non-recursive, stable merge-sort.
- *
- * Maybe natural merge-sort would be better, to do better for
- * partially sorted lists. */
+ *
+ * Maybe natural merge-sort would be better, to do better for
+ * partially sorted lists. */
_split:
stack_head[0].ls2 = _c_list_srt_split(stack_head[0].ls1);
if (stack_head[0].ls2) {