mirror of
https://gitlab.freedesktop.org/NetworkManager/NetworkManager.git
synced 2025-12-24 14:50:07 +01:00
"shared/nm-utils" contains general purpose utility functions that only depend on glib (and extend glib with some helper functions). We will also add code that does not use glib, hence it would be good if the part of "shared/nm-utils" that does not depend on glib, could be used by these future projects. Also, we use the term "utils" everywhere. While that covers the purpose and content well, having everything called "nm-something-utils" is not great. Instead, call this "nm-std-aux", inspired by "c-util/c-stdaux".
66 lines
2.1 KiB
C
66 lines
2.1 KiB
C
/* -*- Mode: C; tab-width: 4; indent-tabs-mode: t; c-basic-offset: 4 -*- */
|
|
/* NetworkManager -- Network link manager
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2 of the License, or (at your option) any later version.
|
|
*
|
|
* This library is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the
|
|
* Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
* Boston, MA 02110-1301 USA.
|
|
*
|
|
* (C) Copyright 2017 Red Hat, Inc.
|
|
*/
|
|
|
|
#ifndef __C_LIST_UTIL_H__
|
|
#define __C_LIST_UTIL_H__
|
|
|
|
#include "c-list/src/c-list.h"
|
|
|
|
/*****************************************************************************/
|
|
|
|
void c_list_relink (CList *lst);
|
|
|
|
typedef int (*CListSortCmp) (const CList *a,
|
|
const CList *b,
|
|
const void *user_data);
|
|
|
|
CList *c_list_sort_headless (CList *lst,
|
|
CListSortCmp cmp,
|
|
const void *user_data);
|
|
|
|
void c_list_sort (CList *head,
|
|
CListSortCmp cmp,
|
|
const void *user_data);
|
|
|
|
/* c_list_length_is:
|
|
* @list: the #CList list head
|
|
* @check_len: the length to compare
|
|
*
|
|
* Returns: basically the same as (c_list_length (@list) == @check_len),
|
|
* but does not require to iterate the entire list first. There is only
|
|
* one real use: to find out whether there is exactly one element in the
|
|
* list, by passing @check_len as 1.
|
|
*/
|
|
static inline int
|
|
c_list_length_is (const CList *list, unsigned long check_len) {
|
|
unsigned long n = 0;
|
|
const CList *iter;
|
|
|
|
c_list_for_each (iter, list) {
|
|
++n;
|
|
if (n > check_len)
|
|
return 0;
|
|
}
|
|
|
|
return n == check_len;
|
|
}
|
|
|
|
#endif /* __C_LIST_UTIL_H__ */
|