2
* Copyright (c) 2000-2002,2005 Silicon Graphics, Inc.
5
* This program is free software; you can redistribute it and/or
6
* modify it under the terms of the GNU General Public License as
7
* published by the Free Software Foundation.
9
* This program is distributed in the hope that it would be useful,
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12
* GNU General Public License for more details.
14
* You should have received a copy of the GNU General Public License
15
* along with this program; if not, write the Free Software Foundation,
16
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20
#include "xfs_types.h"
23
#include "xfs_trans.h"
24
#include "xfs_trans_priv.h"
25
/* XXX: from here down needed until struct xfs_trans has its own ailp */
27
#include "xfs_buf_item.h"
31
#include "xfs_dmapi.h"
32
#include "xfs_mount.h"
34
STATIC int xfs_trans_unlock_chunk(xfs_log_item_chunk_t *,
38
* This is called to add the given log item to the transaction's
39
* list of log items. It must find a free log item descriptor
40
* or allocate a new one and add the item to that descriptor.
41
* The function returns a pointer to item descriptor used to point
42
* to the new item. The log item will now point to its new descriptor
43
* with its li_desc field.
46
xfs_trans_add_item(xfs_trans_t *tp, xfs_log_item_t *lip)
48
xfs_log_item_desc_t *lidp;
49
xfs_log_item_chunk_t *licp;
53
* If there are no free descriptors, allocate a new chunk
54
* of them and put it at the front of the chunk list.
56
if (tp->t_items_free == 0) {
57
licp = (xfs_log_item_chunk_t*)
58
kmem_alloc(sizeof(xfs_log_item_chunk_t), KM_SLEEP);
61
* Initialize the chunk, and then
62
* claim the first slot in the newly allocated chunk.
65
xfs_lic_claim(licp, 0);
67
xfs_lic_init_slot(licp, 0);
68
lidp = xfs_lic_slot(licp, 0);
71
* Link in the new chunk and update the free count.
73
licp->lic_next = tp->t_items.lic_next;
74
tp->t_items.lic_next = licp;
75
tp->t_items_free = XFS_LIC_NUM_SLOTS - 1;
78
* Initialize the descriptor and the generic portion
81
* Point the new slot at this item and return it.
82
* Also point the log item at its currently active
83
* descriptor and set the item's mount pointer.
89
lip->li_mountp = tp->t_mountp;
90
lip->li_ailp = tp->t_mountp->m_ail;
95
* Find the free descriptor. It is somewhere in the chunklist
99
while (licp != NULL) {
100
if (xfs_lic_vacancy(licp)) {
101
if (licp->lic_unused <= XFS_LIC_MAX_SLOT) {
102
i = licp->lic_unused;
103
ASSERT(xfs_lic_isfree(licp, i));
106
for (i = 0; i <= XFS_LIC_MAX_SLOT; i++) {
107
if (xfs_lic_isfree(licp, i))
110
ASSERT(i <= XFS_LIC_MAX_SLOT);
113
licp = licp->lic_next;
115
ASSERT(licp != NULL);
117
* If we find a free descriptor, claim it,
118
* initialize it, and return it.
120
xfs_lic_claim(licp, i);
121
if (licp->lic_unused <= i) {
122
licp->lic_unused = i + 1;
123
xfs_lic_init_slot(licp, i);
125
lidp = xfs_lic_slot(licp, i);
127
lidp->lid_item = lip;
131
lip->li_mountp = tp->t_mountp;
132
lip->li_ailp = tp->t_mountp->m_ail;
137
* Free the given descriptor.
139
* This requires setting the bit in the chunk's free mask corresponding
143
xfs_trans_free_item(xfs_trans_t *tp, xfs_log_item_desc_t *lidp)
146
xfs_log_item_chunk_t *licp;
147
xfs_log_item_chunk_t **licpp;
149
slot = xfs_lic_desc_to_slot(lidp);
150
licp = xfs_lic_desc_to_chunk(lidp);
151
xfs_lic_relse(licp, slot);
152
lidp->lid_item->li_desc = NULL;
156
* If there are no more used items in the chunk and this is not
157
* the chunk embedded in the transaction structure, then free
158
* the chunk. First pull it from the chunk list and then
159
* free it back to the heap. We didn't bother with a doubly
160
* linked list here because the lists should be very short
161
* and this is not a performance path. It's better to save
162
* the memory of the extra pointer.
164
* Also decrement the transaction structure's count of free items
165
* by the number in a chunk since we are freeing an empty chunk.
167
if (xfs_lic_are_all_free(licp) && (licp != &(tp->t_items))) {
168
licpp = &(tp->t_items.lic_next);
169
while (*licpp != licp) {
170
ASSERT(*licpp != NULL);
171
licpp = &((*licpp)->lic_next);
173
*licpp = licp->lic_next;
175
tp->t_items_free -= XFS_LIC_NUM_SLOTS;
180
* This is called to find the descriptor corresponding to the given
181
* log item. It returns a pointer to the descriptor.
182
* The log item MUST have a corresponding descriptor in the given
183
* transaction. This routine does not return NULL, it panics.
185
* The descriptor pointer is kept in the log item's li_desc field.
189
xfs_log_item_desc_t *
190
xfs_trans_find_item(xfs_trans_t *tp, xfs_log_item_t *lip)
192
ASSERT(lip->li_desc != NULL);
199
* Return a pointer to the first descriptor in the chunk list.
200
* This does not return NULL if there are none, it panics.
202
* The first descriptor must be in either the first or second chunk.
203
* This is because the only chunk allowed to be empty is the first.
204
* All others are freed when they become empty.
206
* At some point this and xfs_trans_next_item() should be optimized
207
* to quickly look at the mask to determine if there is anything to
210
xfs_log_item_desc_t *
211
xfs_trans_first_item(xfs_trans_t *tp)
213
xfs_log_item_chunk_t *licp;
218
* If it's not in the first chunk, skip to the second.
220
if (xfs_lic_are_all_free(licp)) {
221
licp = licp->lic_next;
225
* Return the first non-free descriptor in the chunk.
227
ASSERT(!xfs_lic_are_all_free(licp));
228
for (i = 0; i < licp->lic_unused; i++) {
229
if (xfs_lic_isfree(licp, i)) {
233
return xfs_lic_slot(licp, i);
235
cmn_err(CE_WARN, "xfs_trans_first_item() -- no first item");
241
* Given a descriptor, return the next descriptor in the chunk list.
242
* This returns NULL if there are no more used descriptors in the list.
244
* We do this by first locating the chunk in which the descriptor resides,
245
* and then scanning forward in the chunk and the list for the next
249
xfs_log_item_desc_t *
250
xfs_trans_next_item(xfs_trans_t *tp, xfs_log_item_desc_t *lidp)
252
xfs_log_item_chunk_t *licp;
255
licp = xfs_lic_desc_to_chunk(lidp);
258
* First search the rest of the chunk. The for loop keeps us
259
* from referencing things beyond the end of the chunk.
261
for (i = (int)xfs_lic_desc_to_slot(lidp) + 1; i < licp->lic_unused; i++) {
262
if (xfs_lic_isfree(licp, i)) {
266
return xfs_lic_slot(licp, i);
270
* Now search the next chunk. It must be there, because the
271
* next chunk would have been freed if it were empty.
272
* If there is no next chunk, return NULL.
274
if (licp->lic_next == NULL) {
278
licp = licp->lic_next;
279
ASSERT(!xfs_lic_are_all_free(licp));
280
for (i = 0; i < licp->lic_unused; i++) {
281
if (xfs_lic_isfree(licp, i)) {
285
return xfs_lic_slot(licp, i);
289
return NULL; /* keep gcc quite */
293
* This is called to unlock all of the items of a transaction and to free
294
* all the descriptors of that transaction.
296
* It walks the list of descriptors and unlocks each item. It frees
297
* each chunk except that embedded in the transaction as it goes along.
300
xfs_trans_free_items(
304
xfs_log_item_chunk_t *licp;
305
xfs_log_item_chunk_t *next_licp;
308
abort = flags & XFS_TRANS_ABORT;
311
* Special case the embedded chunk so we don't free it below.
313
if (!xfs_lic_are_all_free(licp)) {
314
(void) xfs_trans_unlock_chunk(licp, 1, abort, NULLCOMMITLSN);
315
xfs_lic_all_free(licp);
316
licp->lic_unused = 0;
318
licp = licp->lic_next;
321
* Unlock each item in each chunk and free the chunks.
323
while (licp != NULL) {
324
ASSERT(!xfs_lic_are_all_free(licp));
325
(void) xfs_trans_unlock_chunk(licp, 1, abort, NULLCOMMITLSN);
326
next_licp = licp->lic_next;
332
* Reset the transaction structure's free item count.
334
tp->t_items_free = XFS_LIC_NUM_SLOTS;
335
tp->t_items.lic_next = NULL;
341
* This is called to unlock the items associated with a transaction.
342
* Items which were not logged should be freed.
343
* Those which were logged must still be tracked so they can be unpinned
344
* when the transaction commits.
347
xfs_trans_unlock_items(xfs_trans_t *tp, xfs_lsn_t commit_lsn)
349
xfs_log_item_chunk_t *licp;
350
xfs_log_item_chunk_t *next_licp;
351
xfs_log_item_chunk_t **licpp;
358
* Special case the embedded chunk so we don't free.
360
if (!xfs_lic_are_all_free(licp)) {
361
freed = xfs_trans_unlock_chunk(licp, 0, 0, commit_lsn);
363
licpp = &(tp->t_items.lic_next);
364
licp = licp->lic_next;
367
* Unlock each item in each chunk, free non-dirty descriptors,
368
* and free empty chunks.
370
while (licp != NULL) {
371
ASSERT(!xfs_lic_are_all_free(licp));
372
freed += xfs_trans_unlock_chunk(licp, 0, 0, commit_lsn);
373
next_licp = licp->lic_next;
374
if (xfs_lic_are_all_free(licp)) {
377
freed -= XFS_LIC_NUM_SLOTS;
379
licpp = &(licp->lic_next);
381
ASSERT(*licpp == next_licp);
386
* Fix the free descriptor count in the transaction.
388
tp->t_items_free += freed;
392
* Unlock each item pointed to by a descriptor in the given chunk.
393
* Stamp the commit lsn into each item if necessary.
394
* Free descriptors pointing to items which are not dirty if freeing_chunk
395
* is zero. If freeing_chunk is non-zero, then we need to unlock all
396
* items in the chunk.
398
* Return the number of descriptors freed.
401
xfs_trans_unlock_chunk(
402
xfs_log_item_chunk_t *licp,
405
xfs_lsn_t commit_lsn)
407
xfs_log_item_desc_t *lidp;
413
lidp = licp->lic_descs;
414
for (i = 0; i < licp->lic_unused; i++, lidp++) {
415
if (xfs_lic_isfree(licp, i)) {
418
lip = lidp->lid_item;
421
if (commit_lsn != NULLCOMMITLSN)
422
IOP_COMMITTING(lip, commit_lsn);
424
lip->li_flags |= XFS_LI_ABORTED;
428
* Free the descriptor if the item is not dirty
429
* within this transaction and the caller is not
430
* going to just free the entire thing regardless.
432
if (!(freeing_chunk) &&
433
(!(lidp->lid_flags & XFS_LID_DIRTY) || abort)) {
434
xfs_lic_relse(licp, i);
444
* This is called to add the given busy item to the transaction's
445
* list of busy items. It must find a free busy item descriptor
446
* or allocate a new one and add the item to that descriptor.
447
* The function returns a pointer to busy descriptor used to point
448
* to the new busy entry. The log busy entry will now point to its new
449
* descriptor with its ???? field.
451
xfs_log_busy_slot_t *
452
xfs_trans_add_busy(xfs_trans_t *tp, xfs_agnumber_t ag, xfs_extlen_t idx)
454
xfs_log_busy_chunk_t *lbcp;
455
xfs_log_busy_slot_t *lbsp;
459
* If there are no free descriptors, allocate a new chunk
460
* of them and put it at the front of the chunk list.
462
if (tp->t_busy_free == 0) {
463
lbcp = (xfs_log_busy_chunk_t*)
464
kmem_alloc(sizeof(xfs_log_busy_chunk_t), KM_SLEEP);
465
ASSERT(lbcp != NULL);
467
* Initialize the chunk, and then
468
* claim the first slot in the newly allocated chunk.
471
XFS_LBC_CLAIM(lbcp, 0);
472
lbcp->lbc_unused = 1;
473
lbsp = XFS_LBC_SLOT(lbcp, 0);
476
* Link in the new chunk and update the free count.
478
lbcp->lbc_next = tp->t_busy.lbc_next;
479
tp->t_busy.lbc_next = lbcp;
480
tp->t_busy_free = XFS_LIC_NUM_SLOTS - 1;
483
* Initialize the descriptor and the generic portion
486
* Point the new slot at this item and return it.
487
* Also point the log item at its currently active
488
* descriptor and set the item's mount pointer.
496
* Find the free descriptor. It is somewhere in the chunklist
500
while (lbcp != NULL) {
501
if (XFS_LBC_VACANCY(lbcp)) {
502
if (lbcp->lbc_unused <= XFS_LBC_MAX_SLOT) {
503
i = lbcp->lbc_unused;
506
/* out-of-order vacancy */
507
cmn_err(CE_DEBUG, "OOO vacancy lbcp 0x%p\n", lbcp);
511
lbcp = lbcp->lbc_next;
513
ASSERT(lbcp != NULL);
515
* If we find a free descriptor, claim it,
516
* initialize it, and return it.
518
XFS_LBC_CLAIM(lbcp, i);
519
if (lbcp->lbc_unused <= i) {
520
lbcp->lbc_unused = i + 1;
522
lbsp = XFS_LBC_SLOT(lbcp, i);
531
* xfs_trans_free_busy
532
* Free all of the busy lists from a transaction
535
xfs_trans_free_busy(xfs_trans_t *tp)
537
xfs_log_busy_chunk_t *lbcp;
538
xfs_log_busy_chunk_t *lbcq;
540
lbcp = tp->t_busy.lbc_next;
541
while (lbcp != NULL) {
542
lbcq = lbcp->lbc_next;
547
XFS_LBC_INIT(&tp->t_busy);
548
tp->t_busy.lbc_unused = 0;