1 /* -*- mode: c; c-basic-offset: 8; -*-
2 * vim: noexpandtab sw=8 ts=8 sts=0:
8 * Copyright (C) 2002, 2004 Oracle. All rights reserved.
10 * This program is free software; you can redistribute it and/or
11 * modify it under the terms of the GNU General Public
12 * License as published by the Free Software Foundation; either
13 * version 2 of the License, or (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
18 * General Public License for more details.
20 * You should have received a copy of the GNU General Public
21 * License along with this program; if not, write to the
22 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
23 * Boston, MA 021110-1307, USA.
26 #include <linux/types.h>
27 #include <linux/slab.h>
28 #include <linux/highmem.h>
30 #define MLOG_MASK_PREFIX ML_SUPER
31 #include <cluster/masklog.h>
36 #include "extent_map.h"
37 #include "heartbeat.h"
43 #include "buffer_head_io.h"
45 static s16
__ocfs2_node_num_to_slot(struct ocfs2_slot_info
*si
,
47 static void __ocfs2_fill_slot(struct ocfs2_slot_info
*si
,
51 /* Use the slot information we've collected to create a map of mounted
52 * nodes. Should be holding an EX on super block. assumes slot info is
53 * up to date. Note that we call this *after* we find a slot, so our
54 * own node should be set in the map too... */
55 void ocfs2_populate_mounted_map(struct ocfs2_super
*osb
)
58 struct ocfs2_slot_info
*si
= osb
->slot_info
;
60 spin_lock(&si
->si_lock
);
62 for (i
= 0; i
< si
->si_size
; i
++)
63 if (si
->si_global_node_nums
[i
] != OCFS2_INVALID_SLOT
)
64 ocfs2_node_map_set_bit(osb
, &osb
->mounted_map
,
65 si
->si_global_node_nums
[i
]);
67 spin_unlock(&si
->si_lock
);
70 /* post the slot information on disk into our slot_info struct. */
71 void ocfs2_update_slot_info(struct ocfs2_slot_info
*si
)
76 /* we don't read the slot block here as ocfs2_super_lock
77 * should've made sure we have the most recent copy. */
78 spin_lock(&si
->si_lock
);
79 disk_info
= (__le16
*) si
->si_bh
->b_data
;
81 for (i
= 0; i
< si
->si_size
; i
++)
82 si
->si_global_node_nums
[i
] = le16_to_cpu(disk_info
[i
]);
84 spin_unlock(&si
->si_lock
);
87 /* post the our slot info stuff into it's destination bh and write it
89 int ocfs2_update_disk_slots(struct ocfs2_super
*osb
,
90 struct ocfs2_slot_info
*si
)
93 __le16
*disk_info
= (__le16
*) si
->si_bh
->b_data
;
95 spin_lock(&si
->si_lock
);
96 for (i
= 0; i
< si
->si_size
; i
++)
97 disk_info
[i
] = cpu_to_le16(si
->si_global_node_nums
[i
]);
98 spin_unlock(&si
->si_lock
);
100 status
= ocfs2_write_block(osb
, si
->si_bh
, si
->si_inode
);
107 /* try to find global node in the slot info. Returns
108 * OCFS2_INVALID_SLOT if nothing is found. */
109 static s16
__ocfs2_node_num_to_slot(struct ocfs2_slot_info
*si
,
113 s16 ret
= OCFS2_INVALID_SLOT
;
115 for(i
= 0; i
< si
->si_num_slots
; i
++) {
116 if (global
== si
->si_global_node_nums
[i
]) {
124 static s16
__ocfs2_find_empty_slot(struct ocfs2_slot_info
*si
)
127 s16 ret
= OCFS2_INVALID_SLOT
;
129 for(i
= 0; i
< si
->si_num_slots
; i
++) {
130 if (OCFS2_INVALID_SLOT
== si
->si_global_node_nums
[i
]) {
138 s16
ocfs2_node_num_to_slot(struct ocfs2_slot_info
*si
,
143 spin_lock(&si
->si_lock
);
144 ret
= __ocfs2_node_num_to_slot(si
, global
);
145 spin_unlock(&si
->si_lock
);
149 static void __ocfs2_fill_slot(struct ocfs2_slot_info
*si
,
153 BUG_ON(slot_num
== OCFS2_INVALID_SLOT
);
154 BUG_ON(slot_num
>= si
->si_num_slots
);
155 BUG_ON((node_num
!= O2NM_INVALID_NODE_NUM
) &&
156 (node_num
>= O2NM_MAX_NODES
));
158 si
->si_global_node_nums
[slot_num
] = node_num
;
161 void ocfs2_clear_slot(struct ocfs2_slot_info
*si
,
164 spin_lock(&si
->si_lock
);
165 __ocfs2_fill_slot(si
, slot_num
, OCFS2_INVALID_SLOT
);
166 spin_unlock(&si
->si_lock
);
169 int ocfs2_init_slot_info(struct ocfs2_super
*osb
)
173 struct inode
*inode
= NULL
;
174 struct buffer_head
*bh
= NULL
;
175 struct ocfs2_slot_info
*si
;
177 si
= kzalloc(sizeof(struct ocfs2_slot_info
), GFP_KERNEL
);
184 spin_lock_init(&si
->si_lock
);
185 si
->si_num_slots
= osb
->max_slots
;
186 si
->si_size
= OCFS2_MAX_SLOTS
;
188 for(i
= 0; i
< si
->si_num_slots
; i
++)
189 si
->si_global_node_nums
[i
] = OCFS2_INVALID_SLOT
;
191 inode
= ocfs2_get_system_file_inode(osb
, SLOT_MAP_SYSTEM_INODE
,
199 status
= ocfs2_extent_map_get_blocks(inode
, 0ULL, &blkno
, NULL
, NULL
);
205 status
= ocfs2_read_block(osb
, blkno
, &bh
, 0, inode
);
211 si
->si_inode
= inode
;
215 if (status
< 0 && si
)
216 ocfs2_free_slot_info(si
);
221 void ocfs2_free_slot_info(struct ocfs2_slot_info
*si
)
230 int ocfs2_find_slot(struct ocfs2_super
*osb
)
234 struct ocfs2_slot_info
*si
;
240 ocfs2_update_slot_info(si
);
242 spin_lock(&si
->si_lock
);
243 /* search for ourselves first and take the slot if it already
244 * exists. Perhaps we need to mark this in a variable for our
245 * own journal recovery? Possibly not, though we certainly
246 * need to warn to the user */
247 slot
= __ocfs2_node_num_to_slot(si
, osb
->node_num
);
248 if (slot
== OCFS2_INVALID_SLOT
) {
249 /* if no slot yet, then just take 1st available
251 slot
= __ocfs2_find_empty_slot(si
);
252 if (slot
== OCFS2_INVALID_SLOT
) {
253 spin_unlock(&si
->si_lock
);
254 mlog(ML_ERROR
, "no free slots available!\n");
259 mlog(ML_NOTICE
, "slot %d is already allocated to this node!\n",
262 __ocfs2_fill_slot(si
, slot
, osb
->node_num
);
263 osb
->slot_num
= slot
;
264 spin_unlock(&si
->si_lock
);
266 mlog(0, "taking node slot %d\n", osb
->slot_num
);
268 status
= ocfs2_update_disk_slots(osb
, si
);
277 void ocfs2_put_slot(struct ocfs2_super
*osb
)
280 struct ocfs2_slot_info
*si
= osb
->slot_info
;
285 ocfs2_update_slot_info(si
);
287 spin_lock(&si
->si_lock
);
288 __ocfs2_fill_slot(si
, osb
->slot_num
, OCFS2_INVALID_SLOT
);
289 osb
->slot_num
= OCFS2_INVALID_SLOT
;
290 spin_unlock(&si
->si_lock
);
292 status
= ocfs2_update_disk_slots(osb
, si
);
299 osb
->slot_info
= NULL
;
300 ocfs2_free_slot_info(si
);