File: common.h

package info (click to toggle)
sunxi-tools 1.2-2
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd
  • size: 404 kB
  • ctags: 515
  • sloc: ansic: 3,023; sh: 123; makefile: 85; asm: 16
file content (107 lines) | stat: -rw-r--r-- 2,736 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
/*
 * 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 2 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_COMMON_H
#define _SUNXI_TOOLS_COMMON_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

/** calculate number of elements of an array */
#ifndef ARRAY_SIZE
#define ARRAY_SIZE(A)		(sizeof(A)/sizeof((A)[0]))
#endif

/** shortcut to printf to stderr */
#define errf(...)	fprintf(stderr, __VA_ARGS__)

/*
 * list
 */

/** 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;
}

/** puts an entry between two other on a list */
static inline void list_inject(struct list_entry *l,
			       struct list_entry *prev,
			       struct list_entry *next)
{
	l->prev = prev;
	l->next = next;

	next->prev = l;
	prev->next = l;
}

#define list_insert(H, E)	list_inject((E), (H), (H)->next)
#define list_append(H, E)	list_inject((E), (H)->prev, (H))

/** 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 first element of a list */
static inline struct list_entry *list_first(struct list_entry *l)
{
	return (l->next == l) ? NULL : l->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 next element on a list */
static inline struct list_entry *list_next(struct list_entry *l,
					   struct list_entry *e)
{
	return (e->next == l) ? NULL : e->next;
}

/** is list empty? */
static inline int list_empty(struct list_entry *l)
{
	return (l->prev == l);
}

#endif