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
|
/*
* Copyright (C) 2011 Paulo Alcantara <pcacjr@gmail.com>
*
* 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, write to the
* Free Software Foundation, Inc.,
* 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#ifndef _RUNLIST_H_
#define _RUNLIST_H_
struct runlist_element {
uint64_t vcn;
int64_t lcn;
uint64_t len;
};
struct runlist {
struct runlist_element run;
struct runlist *next;
};
static struct runlist *tail;
static inline bool runlist_is_empty(struct runlist *rlist)
{
return !rlist;
}
static inline struct runlist *runlist_alloc(void)
{
struct runlist *rlist;
rlist = malloc(sizeof *rlist);
if (!rlist)
malloc_error("runlist structure");
rlist->next = NULL;
return rlist;
}
static inline void runlist_append(struct runlist **rlist,
struct runlist_element *elem)
{
struct runlist *n = runlist_alloc();
n->run = *elem;
if (runlist_is_empty(*rlist)) {
*rlist = n;
tail = n;
} else {
tail->next = n;
tail = n;
}
}
static inline struct runlist *runlist_remove(struct runlist **rlist)
{
struct runlist *ret;
if (runlist_is_empty(*rlist))
return NULL;
ret = *rlist;
*rlist = ret->next;
return ret;
}
#endif /* _RUNLIST_H_ */
|
