blob: c881ebb5afea7e9f973e0e64c5594ad5ececb54a (
plain)
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
|
/***************************************************************************
* Copyright (C) 2010 by Roberto Maar *
* robi@users.berlios.de *
* *
* 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. *
***************************************************************************/
// A special doubly linked ringbuffer for manage journalinode
#ifndef RING_BUF_H
#define RING_BUF_H
/* ext3/4 libraries */
#include <ext2fs/ext2fs.h>
typedef struct transaction_range{
__u32 start;
__u32 end;
} trans_range_t;
struct ring_buf_item {
struct ring_buf_item *prev;
struct ring_buf_item *next;
struct ext2_inode_large *inode;
trans_range_t transaction;
};
struct ring_buf {
struct ring_buf_item * begin;
int count;
int i_size;
__u32 nr;
char del_flag;
char reuse_flag;
};
typedef struct ring_buf_item r_item;
static inline r_item* r_first(struct ring_buf *head){
return (head->count) ? head->begin : NULL ;}
static inline r_item* r_last(struct ring_buf *head){
return (head->count) ? head->begin->prev : NULL ; }
static inline r_item* r_next(r_item *item){
return item->next;}
static inline r_item* r_prev(r_item *item){
return item->prev;}
static inline int r_get_count(struct ring_buf *head){
return head->count;}
r_item* r_item_new( int );
struct ring_buf* ring_new( int , __u32);
r_item* r_item_add(struct ring_buf*);
void ring_del(struct ring_buf*);
r_item* r_begin(struct ring_buf*);
#endif
|
