85 lines
2.2 KiB
C
85 lines
2.2 KiB
C
/*
|
|
* Copyright (C) 2012 Alejandro Mery <amery@geeks.cl>
|
|
*
|
|
* This program is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* This program 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 General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
#ifndef _SUNXI_TOOLS_H
|
|
#define _SUNXI_TOOLS_H
|
|
|
|
#include <stddef.h> /* offsetof */
|
|
|
|
/** flat function argument as unused */
|
|
#ifdef UNUSED
|
|
#elif defined(__GNUC__)
|
|
# define UNUSED(x) UNUSED_ ## x __attribute__((unused))
|
|
#else
|
|
# define UNUSED(x) UNUSED_ ## x
|
|
#endif
|
|
|
|
/** finds the parent of an struct member */
|
|
#ifndef container_of
|
|
#define container_of(P,T,M) (T *)((char *)(P) - offsetof(T, M))
|
|
#endif
|
|
|
|
/** shortcut to printf to stderr */
|
|
#define errf(...) fprintf(stderr, __VA_ARGS__)
|
|
|
|
/** a list hook */
|
|
struct list_entry {
|
|
struct list_entry *prev;
|
|
struct list_entry *next;
|
|
};
|
|
|
|
/** initialize an empty list hook */
|
|
static inline void list_init(struct list_entry *self)
|
|
{
|
|
self->prev = self->next = self;
|
|
}
|
|
|
|
/** appends a list hook @l1 at the end of the list @l0 */
|
|
static inline void list_append(struct list_entry *l0, struct list_entry *l1)
|
|
{
|
|
l1->next = l0;
|
|
l1->prev = l0->prev;
|
|
l0->prev = l1;
|
|
}
|
|
|
|
/** removes an entry for the list where it's contained */
|
|
static inline void list_remove(struct list_entry *l)
|
|
{
|
|
struct list_entry *prev = l->prev, *next = l->next;
|
|
next->prev = prev;
|
|
prev->next = next;
|
|
}
|
|
|
|
/** returns last element of a list */
|
|
static inline struct list_entry *list_last(struct list_entry *l)
|
|
{
|
|
return (l->prev == l) ? NULL : l->prev;
|
|
}
|
|
|
|
/** returns first element of a list */
|
|
static inline struct list_entry *list_first(struct list_entry *l)
|
|
{
|
|
return (l->next == l) ? NULL : l->next;
|
|
}
|
|
|
|
/** is list empty? */
|
|
static inline int list_empty(struct list_entry *l)
|
|
{
|
|
return (l->prev == l);
|
|
}
|
|
|
|
#endif
|