JFS: use print_hex_dump() rather than private dump_mem() function
[linux-2.6.git] / fs / jfs / jfs_txnmgr.c
blobd6f23f90ad363625086dba9dba18ece7c8e2212d
1 /*
2 * Copyright (C) International Business Machines Corp., 2000-2005
3 * Portions Copyright (C) Christoph Hellwig, 2001-2002
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License as published by
7 * the Free Software Foundation; either version 2 of the License, or
8 * (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See
13 * the GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 * jfs_txnmgr.c: transaction manager
23 * notes:
24 * transaction starts with txBegin() and ends with txCommit()
25 * or txAbort().
27 * tlock is acquired at the time of update;
28 * (obviate scan at commit time for xtree and dtree)
29 * tlock and mp points to each other;
30 * (no hashlist for mp -> tlock).
32 * special cases:
33 * tlock on in-memory inode:
34 * in-place tlock in the in-memory inode itself;
35 * converted to page lock by iWrite() at commit time.
37 * tlock during write()/mmap() under anonymous transaction (tid = 0):
38 * transferred (?) to transaction at commit time.
40 * use the page itself to update allocation maps
41 * (obviate intermediate replication of allocation/deallocation data)
42 * hold on to mp+lock thru update of maps
45 #include <linux/fs.h>
46 #include <linux/vmalloc.h>
47 #include <linux/completion.h>
48 #include <linux/freezer.h>
49 #include <linux/module.h>
50 #include <linux/moduleparam.h>
51 #include <linux/kthread.h>
52 #include "jfs_incore.h"
53 #include "jfs_inode.h"
54 #include "jfs_filsys.h"
55 #include "jfs_metapage.h"
56 #include "jfs_dinode.h"
57 #include "jfs_imap.h"
58 #include "jfs_dmap.h"
59 #include "jfs_superblock.h"
60 #include "jfs_debug.h"
63 * transaction management structures
65 static struct {
66 int freetid; /* index of a free tid structure */
67 int freelock; /* index first free lock word */
68 wait_queue_head_t freewait; /* eventlist of free tblock */
69 wait_queue_head_t freelockwait; /* eventlist of free tlock */
70 wait_queue_head_t lowlockwait; /* eventlist of ample tlocks */
71 int tlocksInUse; /* Number of tlocks in use */
72 spinlock_t LazyLock; /* synchronize sync_queue & unlock_queue */
73 /* struct tblock *sync_queue; * Transactions waiting for data sync */
74 struct list_head unlock_queue; /* Txns waiting to be released */
75 struct list_head anon_list; /* inodes having anonymous txns */
76 struct list_head anon_list2; /* inodes having anonymous txns
77 that couldn't be sync'ed */
78 } TxAnchor;
80 int jfs_tlocks_low; /* Indicates low number of available tlocks */
82 #ifdef CONFIG_JFS_STATISTICS
83 static struct {
84 uint txBegin;
85 uint txBegin_barrier;
86 uint txBegin_lockslow;
87 uint txBegin_freetid;
88 uint txBeginAnon;
89 uint txBeginAnon_barrier;
90 uint txBeginAnon_lockslow;
91 uint txLockAlloc;
92 uint txLockAlloc_freelock;
93 } TxStat;
94 #endif
96 static int nTxBlock = -1; /* number of transaction blocks */
97 module_param(nTxBlock, int, 0);
98 MODULE_PARM_DESC(nTxBlock,
99 "Number of transaction blocks (max:65536)");
101 static int nTxLock = -1; /* number of transaction locks */
102 module_param(nTxLock, int, 0);
103 MODULE_PARM_DESC(nTxLock,
104 "Number of transaction locks (max:65536)");
106 struct tblock *TxBlock; /* transaction block table */
107 static int TxLockLWM; /* Low water mark for number of txLocks used */
108 static int TxLockHWM; /* High water mark for number of txLocks used */
109 static int TxLockVHWM; /* Very High water mark */
110 struct tlock *TxLock; /* transaction lock table */
113 * transaction management lock
115 static DEFINE_SPINLOCK(jfsTxnLock);
117 #define TXN_LOCK() spin_lock(&jfsTxnLock)
118 #define TXN_UNLOCK() spin_unlock(&jfsTxnLock)
120 #define LAZY_LOCK_INIT() spin_lock_init(&TxAnchor.LazyLock);
121 #define LAZY_LOCK(flags) spin_lock_irqsave(&TxAnchor.LazyLock, flags)
122 #define LAZY_UNLOCK(flags) spin_unlock_irqrestore(&TxAnchor.LazyLock, flags)
124 static DECLARE_WAIT_QUEUE_HEAD(jfs_commit_thread_wait);
125 static int jfs_commit_thread_waking;
128 * Retry logic exist outside these macros to protect from spurrious wakeups.
130 static inline void TXN_SLEEP_DROP_LOCK(wait_queue_head_t * event)
132 DECLARE_WAITQUEUE(wait, current);
134 add_wait_queue(event, &wait);
135 set_current_state(TASK_UNINTERRUPTIBLE);
136 TXN_UNLOCK();
137 io_schedule();
138 __set_current_state(TASK_RUNNING);
139 remove_wait_queue(event, &wait);
142 #define TXN_SLEEP(event)\
144 TXN_SLEEP_DROP_LOCK(event);\
145 TXN_LOCK();\
148 #define TXN_WAKEUP(event) wake_up_all(event)
151 * statistics
153 static struct {
154 tid_t maxtid; /* 4: biggest tid ever used */
155 lid_t maxlid; /* 4: biggest lid ever used */
156 int ntid; /* 4: # of transactions performed */
157 int nlid; /* 4: # of tlocks acquired */
158 int waitlock; /* 4: # of tlock wait */
159 } stattx;
162 * forward references
164 static int diLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
165 struct tlock * tlck, struct commit * cd);
166 static int dataLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
167 struct tlock * tlck);
168 static void dtLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
169 struct tlock * tlck);
170 static void mapLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
171 struct tlock * tlck);
172 static void txAllocPMap(struct inode *ip, struct maplock * maplock,
173 struct tblock * tblk);
174 static void txForce(struct tblock * tblk);
175 static int txLog(struct jfs_log * log, struct tblock * tblk,
176 struct commit * cd);
177 static void txUpdateMap(struct tblock * tblk);
178 static void txRelease(struct tblock * tblk);
179 static void xtLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
180 struct tlock * tlck);
181 static void LogSyncRelease(struct metapage * mp);
184 * transaction block/lock management
185 * ---------------------------------
189 * Get a transaction lock from the free list. If the number in use is
190 * greater than the high water mark, wake up the sync daemon. This should
191 * free some anonymous transaction locks. (TXN_LOCK must be held.)
193 static lid_t txLockAlloc(void)
195 lid_t lid;
197 INCREMENT(TxStat.txLockAlloc);
198 if (!TxAnchor.freelock) {
199 INCREMENT(TxStat.txLockAlloc_freelock);
202 while (!(lid = TxAnchor.freelock))
203 TXN_SLEEP(&TxAnchor.freelockwait);
204 TxAnchor.freelock = TxLock[lid].next;
205 HIGHWATERMARK(stattx.maxlid, lid);
206 if ((++TxAnchor.tlocksInUse > TxLockHWM) && (jfs_tlocks_low == 0)) {
207 jfs_info("txLockAlloc tlocks low");
208 jfs_tlocks_low = 1;
209 wake_up_process(jfsSyncThread);
212 return lid;
215 static void txLockFree(lid_t lid)
217 TxLock[lid].tid = 0;
218 TxLock[lid].next = TxAnchor.freelock;
219 TxAnchor.freelock = lid;
220 TxAnchor.tlocksInUse--;
221 if (jfs_tlocks_low && (TxAnchor.tlocksInUse < TxLockLWM)) {
222 jfs_info("txLockFree jfs_tlocks_low no more");
223 jfs_tlocks_low = 0;
224 TXN_WAKEUP(&TxAnchor.lowlockwait);
226 TXN_WAKEUP(&TxAnchor.freelockwait);
230 * NAME: txInit()
232 * FUNCTION: initialize transaction management structures
234 * RETURN:
236 * serialization: single thread at jfs_init()
238 int txInit(void)
240 int k, size;
241 struct sysinfo si;
243 /* Set defaults for nTxLock and nTxBlock if unset */
245 if (nTxLock == -1) {
246 if (nTxBlock == -1) {
247 /* Base default on memory size */
248 si_meminfo(&si);
249 if (si.totalram > (256 * 1024)) /* 1 GB */
250 nTxLock = 64 * 1024;
251 else
252 nTxLock = si.totalram >> 2;
253 } else if (nTxBlock > (8 * 1024))
254 nTxLock = 64 * 1024;
255 else
256 nTxLock = nTxBlock << 3;
258 if (nTxBlock == -1)
259 nTxBlock = nTxLock >> 3;
261 /* Verify tunable parameters */
262 if (nTxBlock < 16)
263 nTxBlock = 16; /* No one should set it this low */
264 if (nTxBlock > 65536)
265 nTxBlock = 65536;
266 if (nTxLock < 256)
267 nTxLock = 256; /* No one should set it this low */
268 if (nTxLock > 65536)
269 nTxLock = 65536;
271 printk(KERN_INFO "JFS: nTxBlock = %d, nTxLock = %d\n",
272 nTxBlock, nTxLock);
274 * initialize transaction block (tblock) table
276 * transaction id (tid) = tblock index
277 * tid = 0 is reserved.
279 TxLockLWM = (nTxLock * 4) / 10;
280 TxLockHWM = (nTxLock * 7) / 10;
281 TxLockVHWM = (nTxLock * 8) / 10;
283 size = sizeof(struct tblock) * nTxBlock;
284 TxBlock = vmalloc(size);
285 if (TxBlock == NULL)
286 return -ENOMEM;
288 for (k = 1; k < nTxBlock - 1; k++) {
289 TxBlock[k].next = k + 1;
290 init_waitqueue_head(&TxBlock[k].gcwait);
291 init_waitqueue_head(&TxBlock[k].waitor);
293 TxBlock[k].next = 0;
294 init_waitqueue_head(&TxBlock[k].gcwait);
295 init_waitqueue_head(&TxBlock[k].waitor);
297 TxAnchor.freetid = 1;
298 init_waitqueue_head(&TxAnchor.freewait);
300 stattx.maxtid = 1; /* statistics */
303 * initialize transaction lock (tlock) table
305 * transaction lock id = tlock index
306 * tlock id = 0 is reserved.
308 size = sizeof(struct tlock) * nTxLock;
309 TxLock = vmalloc(size);
310 if (TxLock == NULL) {
311 vfree(TxBlock);
312 return -ENOMEM;
315 /* initialize tlock table */
316 for (k = 1; k < nTxLock - 1; k++)
317 TxLock[k].next = k + 1;
318 TxLock[k].next = 0;
319 init_waitqueue_head(&TxAnchor.freelockwait);
320 init_waitqueue_head(&TxAnchor.lowlockwait);
322 TxAnchor.freelock = 1;
323 TxAnchor.tlocksInUse = 0;
324 INIT_LIST_HEAD(&TxAnchor.anon_list);
325 INIT_LIST_HEAD(&TxAnchor.anon_list2);
327 LAZY_LOCK_INIT();
328 INIT_LIST_HEAD(&TxAnchor.unlock_queue);
330 stattx.maxlid = 1; /* statistics */
332 return 0;
336 * NAME: txExit()
338 * FUNCTION: clean up when module is unloaded
340 void txExit(void)
342 vfree(TxLock);
343 TxLock = NULL;
344 vfree(TxBlock);
345 TxBlock = NULL;
349 * NAME: txBegin()
351 * FUNCTION: start a transaction.
353 * PARAMETER: sb - superblock
354 * flag - force for nested tx;
356 * RETURN: tid - transaction id
358 * note: flag force allows to start tx for nested tx
359 * to prevent deadlock on logsync barrier;
361 tid_t txBegin(struct super_block *sb, int flag)
363 tid_t t;
364 struct tblock *tblk;
365 struct jfs_log *log;
367 jfs_info("txBegin: flag = 0x%x", flag);
368 log = JFS_SBI(sb)->log;
370 TXN_LOCK();
372 INCREMENT(TxStat.txBegin);
374 retry:
375 if (!(flag & COMMIT_FORCE)) {
377 * synchronize with logsync barrier
379 if (test_bit(log_SYNCBARRIER, &log->flag) ||
380 test_bit(log_QUIESCE, &log->flag)) {
381 INCREMENT(TxStat.txBegin_barrier);
382 TXN_SLEEP(&log->syncwait);
383 goto retry;
386 if (flag == 0) {
388 * Don't begin transaction if we're getting starved for tlocks
389 * unless COMMIT_FORCE or COMMIT_INODE (which may ultimately
390 * free tlocks)
392 if (TxAnchor.tlocksInUse > TxLockVHWM) {
393 INCREMENT(TxStat.txBegin_lockslow);
394 TXN_SLEEP(&TxAnchor.lowlockwait);
395 goto retry;
400 * allocate transaction id/block
402 if ((t = TxAnchor.freetid) == 0) {
403 jfs_info("txBegin: waiting for free tid");
404 INCREMENT(TxStat.txBegin_freetid);
405 TXN_SLEEP(&TxAnchor.freewait);
406 goto retry;
409 tblk = tid_to_tblock(t);
411 if ((tblk->next == 0) && !(flag & COMMIT_FORCE)) {
412 /* Don't let a non-forced transaction take the last tblk */
413 jfs_info("txBegin: waiting for free tid");
414 INCREMENT(TxStat.txBegin_freetid);
415 TXN_SLEEP(&TxAnchor.freewait);
416 goto retry;
419 TxAnchor.freetid = tblk->next;
422 * initialize transaction
426 * We can't zero the whole thing or we screw up another thread being
427 * awakened after sleeping on tblk->waitor
429 * memset(tblk, 0, sizeof(struct tblock));
431 tblk->next = tblk->last = tblk->xflag = tblk->flag = tblk->lsn = 0;
433 tblk->sb = sb;
434 ++log->logtid;
435 tblk->logtid = log->logtid;
437 ++log->active;
439 HIGHWATERMARK(stattx.maxtid, t); /* statistics */
440 INCREMENT(stattx.ntid); /* statistics */
442 TXN_UNLOCK();
444 jfs_info("txBegin: returning tid = %d", t);
446 return t;
450 * NAME: txBeginAnon()
452 * FUNCTION: start an anonymous transaction.
453 * Blocks if logsync or available tlocks are low to prevent
454 * anonymous tlocks from depleting supply.
456 * PARAMETER: sb - superblock
458 * RETURN: none
460 void txBeginAnon(struct super_block *sb)
462 struct jfs_log *log;
464 log = JFS_SBI(sb)->log;
466 TXN_LOCK();
467 INCREMENT(TxStat.txBeginAnon);
469 retry:
471 * synchronize with logsync barrier
473 if (test_bit(log_SYNCBARRIER, &log->flag) ||
474 test_bit(log_QUIESCE, &log->flag)) {
475 INCREMENT(TxStat.txBeginAnon_barrier);
476 TXN_SLEEP(&log->syncwait);
477 goto retry;
481 * Don't begin transaction if we're getting starved for tlocks
483 if (TxAnchor.tlocksInUse > TxLockVHWM) {
484 INCREMENT(TxStat.txBeginAnon_lockslow);
485 TXN_SLEEP(&TxAnchor.lowlockwait);
486 goto retry;
488 TXN_UNLOCK();
492 * txEnd()
494 * function: free specified transaction block.
496 * logsync barrier processing:
498 * serialization:
500 void txEnd(tid_t tid)
502 struct tblock *tblk = tid_to_tblock(tid);
503 struct jfs_log *log;
505 jfs_info("txEnd: tid = %d", tid);
506 TXN_LOCK();
509 * wakeup transactions waiting on the page locked
510 * by the current transaction
512 TXN_WAKEUP(&tblk->waitor);
514 log = JFS_SBI(tblk->sb)->log;
517 * Lazy commit thread can't free this guy until we mark it UNLOCKED,
518 * otherwise, we would be left with a transaction that may have been
519 * reused.
521 * Lazy commit thread will turn off tblkGC_LAZY before calling this
522 * routine.
524 if (tblk->flag & tblkGC_LAZY) {
525 jfs_info("txEnd called w/lazy tid: %d, tblk = 0x%p", tid, tblk);
526 TXN_UNLOCK();
528 spin_lock_irq(&log->gclock); // LOGGC_LOCK
529 tblk->flag |= tblkGC_UNLOCKED;
530 spin_unlock_irq(&log->gclock); // LOGGC_UNLOCK
531 return;
534 jfs_info("txEnd: tid: %d, tblk = 0x%p", tid, tblk);
536 assert(tblk->next == 0);
539 * insert tblock back on freelist
541 tblk->next = TxAnchor.freetid;
542 TxAnchor.freetid = tid;
545 * mark the tblock not active
547 if (--log->active == 0) {
548 clear_bit(log_FLUSH, &log->flag);
551 * synchronize with logsync barrier
553 if (test_bit(log_SYNCBARRIER, &log->flag)) {
554 TXN_UNLOCK();
556 /* write dirty metadata & forward log syncpt */
557 jfs_syncpt(log, 1);
559 jfs_info("log barrier off: 0x%x", log->lsn);
561 /* enable new transactions start */
562 clear_bit(log_SYNCBARRIER, &log->flag);
564 /* wakeup all waitors for logsync barrier */
565 TXN_WAKEUP(&log->syncwait);
567 goto wakeup;
571 TXN_UNLOCK();
572 wakeup:
574 * wakeup all waitors for a free tblock
576 TXN_WAKEUP(&TxAnchor.freewait);
580 * txLock()
582 * function: acquire a transaction lock on the specified <mp>
584 * parameter:
586 * return: transaction lock id
588 * serialization:
590 struct tlock *txLock(tid_t tid, struct inode *ip, struct metapage * mp,
591 int type)
593 struct jfs_inode_info *jfs_ip = JFS_IP(ip);
594 int dir_xtree = 0;
595 lid_t lid;
596 tid_t xtid;
597 struct tlock *tlck;
598 struct xtlock *xtlck;
599 struct linelock *linelock;
600 xtpage_t *p;
601 struct tblock *tblk;
603 TXN_LOCK();
605 if (S_ISDIR(ip->i_mode) && (type & tlckXTREE) &&
606 !(mp->xflag & COMMIT_PAGE)) {
608 * Directory inode is special. It can have both an xtree tlock
609 * and a dtree tlock associated with it.
611 dir_xtree = 1;
612 lid = jfs_ip->xtlid;
613 } else
614 lid = mp->lid;
616 /* is page not locked by a transaction ? */
617 if (lid == 0)
618 goto allocateLock;
620 jfs_info("txLock: tid:%d ip:0x%p mp:0x%p lid:%d", tid, ip, mp, lid);
622 /* is page locked by the requester transaction ? */
623 tlck = lid_to_tlock(lid);
624 if ((xtid = tlck->tid) == tid) {
625 TXN_UNLOCK();
626 goto grantLock;
630 * is page locked by anonymous transaction/lock ?
632 * (page update without transaction (i.e., file write) is
633 * locked under anonymous transaction tid = 0:
634 * anonymous tlocks maintained on anonymous tlock list of
635 * the inode of the page and available to all anonymous
636 * transactions until txCommit() time at which point
637 * they are transferred to the transaction tlock list of
638 * the commiting transaction of the inode)
640 if (xtid == 0) {
641 tlck->tid = tid;
642 TXN_UNLOCK();
643 tblk = tid_to_tblock(tid);
645 * The order of the tlocks in the transaction is important
646 * (during truncate, child xtree pages must be freed before
647 * parent's tlocks change the working map).
648 * Take tlock off anonymous list and add to tail of
649 * transaction list
651 * Note: We really need to get rid of the tid & lid and
652 * use list_head's. This code is getting UGLY!
654 if (jfs_ip->atlhead == lid) {
655 if (jfs_ip->atltail == lid) {
656 /* only anonymous txn.
657 * Remove from anon_list
659 TXN_LOCK();
660 list_del_init(&jfs_ip->anon_inode_list);
661 TXN_UNLOCK();
663 jfs_ip->atlhead = tlck->next;
664 } else {
665 lid_t last;
666 for (last = jfs_ip->atlhead;
667 lid_to_tlock(last)->next != lid;
668 last = lid_to_tlock(last)->next) {
669 assert(last);
671 lid_to_tlock(last)->next = tlck->next;
672 if (jfs_ip->atltail == lid)
673 jfs_ip->atltail = last;
676 /* insert the tlock at tail of transaction tlock list */
678 if (tblk->next)
679 lid_to_tlock(tblk->last)->next = lid;
680 else
681 tblk->next = lid;
682 tlck->next = 0;
683 tblk->last = lid;
685 goto grantLock;
688 goto waitLock;
691 * allocate a tlock
693 allocateLock:
694 lid = txLockAlloc();
695 tlck = lid_to_tlock(lid);
698 * initialize tlock
700 tlck->tid = tid;
702 TXN_UNLOCK();
704 /* mark tlock for meta-data page */
705 if (mp->xflag & COMMIT_PAGE) {
707 tlck->flag = tlckPAGELOCK;
709 /* mark the page dirty and nohomeok */
710 metapage_nohomeok(mp);
712 jfs_info("locking mp = 0x%p, nohomeok = %d tid = %d tlck = 0x%p",
713 mp, mp->nohomeok, tid, tlck);
715 /* if anonymous transaction, and buffer is on the group
716 * commit synclist, mark inode to show this. This will
717 * prevent the buffer from being marked nohomeok for too
718 * long a time.
720 if ((tid == 0) && mp->lsn)
721 set_cflag(COMMIT_Synclist, ip);
723 /* mark tlock for in-memory inode */
724 else
725 tlck->flag = tlckINODELOCK;
727 if (S_ISDIR(ip->i_mode))
728 tlck->flag |= tlckDIRECTORY;
730 tlck->type = 0;
732 /* bind the tlock and the page */
733 tlck->ip = ip;
734 tlck->mp = mp;
735 if (dir_xtree)
736 jfs_ip->xtlid = lid;
737 else
738 mp->lid = lid;
741 * enqueue transaction lock to transaction/inode
743 /* insert the tlock at tail of transaction tlock list */
744 if (tid) {
745 tblk = tid_to_tblock(tid);
746 if (tblk->next)
747 lid_to_tlock(tblk->last)->next = lid;
748 else
749 tblk->next = lid;
750 tlck->next = 0;
751 tblk->last = lid;
753 /* anonymous transaction:
754 * insert the tlock at head of inode anonymous tlock list
756 else {
757 tlck->next = jfs_ip->atlhead;
758 jfs_ip->atlhead = lid;
759 if (tlck->next == 0) {
760 /* This inode's first anonymous transaction */
761 jfs_ip->atltail = lid;
762 TXN_LOCK();
763 list_add_tail(&jfs_ip->anon_inode_list,
764 &TxAnchor.anon_list);
765 TXN_UNLOCK();
769 /* initialize type dependent area for linelock */
770 linelock = (struct linelock *) & tlck->lock;
771 linelock->next = 0;
772 linelock->flag = tlckLINELOCK;
773 linelock->maxcnt = TLOCKSHORT;
774 linelock->index = 0;
776 switch (type & tlckTYPE) {
777 case tlckDTREE:
778 linelock->l2linesize = L2DTSLOTSIZE;
779 break;
781 case tlckXTREE:
782 linelock->l2linesize = L2XTSLOTSIZE;
784 xtlck = (struct xtlock *) linelock;
785 xtlck->header.offset = 0;
786 xtlck->header.length = 2;
788 if (type & tlckNEW) {
789 xtlck->lwm.offset = XTENTRYSTART;
790 } else {
791 if (mp->xflag & COMMIT_PAGE)
792 p = (xtpage_t *) mp->data;
793 else
794 p = &jfs_ip->i_xtroot;
795 xtlck->lwm.offset =
796 le16_to_cpu(p->header.nextindex);
798 xtlck->lwm.length = 0; /* ! */
799 xtlck->twm.offset = 0;
800 xtlck->hwm.offset = 0;
802 xtlck->index = 2;
803 break;
805 case tlckINODE:
806 linelock->l2linesize = L2INODESLOTSIZE;
807 break;
809 case tlckDATA:
810 linelock->l2linesize = L2DATASLOTSIZE;
811 break;
813 default:
814 jfs_err("UFO tlock:0x%p", tlck);
818 * update tlock vector
820 grantLock:
821 tlck->type |= type;
823 return tlck;
826 * page is being locked by another transaction:
828 waitLock:
829 /* Only locks on ipimap or ipaimap should reach here */
830 /* assert(jfs_ip->fileset == AGGREGATE_I); */
831 if (jfs_ip->fileset != AGGREGATE_I) {
832 printk(KERN_ERR "txLock: trying to lock locked page!");
833 printk(KERN_ERR "ip:\n");
834 print_hex_dump(KERN_ERR, DUMP_PREFIX_ADDRESS, ip, sizeof(*ip));
835 printk(KERN_ERR "mp:\n");
836 print_hex_dump(KERN_ERR, DUMP_PREFIX_ADDRESS, mp, sizeof(*mp));
837 printk(KERN_ERR "Locker's tblk:\n");
838 print_hex_dump(KERN_ERR, DUMP_PREFIX_ADDRESS,
839 tid_to_tblock(tid), sizeof(struct tblock));
840 printk(KERN_ERR "Tlock:\n");
841 print_hex_dump(KERN_ERR, DUMP_PREFIX_ADDRESS, tlck,
842 sizeof(*tlck));
843 BUG();
845 INCREMENT(stattx.waitlock); /* statistics */
846 TXN_UNLOCK();
847 release_metapage(mp);
848 TXN_LOCK();
849 xtid = tlck->tid; /* reacquire after dropping TXN_LOCK */
851 jfs_info("txLock: in waitLock, tid = %d, xtid = %d, lid = %d",
852 tid, xtid, lid);
854 /* Recheck everything since dropping TXN_LOCK */
855 if (xtid && (tlck->mp == mp) && (mp->lid == lid))
856 TXN_SLEEP_DROP_LOCK(&tid_to_tblock(xtid)->waitor);
857 else
858 TXN_UNLOCK();
859 jfs_info("txLock: awakened tid = %d, lid = %d", tid, lid);
861 return NULL;
865 * NAME: txRelease()
867 * FUNCTION: Release buffers associated with transaction locks, but don't
868 * mark homeok yet. The allows other transactions to modify
869 * buffers, but won't let them go to disk until commit record
870 * actually gets written.
872 * PARAMETER:
873 * tblk -
875 * RETURN: Errors from subroutines.
877 static void txRelease(struct tblock * tblk)
879 struct metapage *mp;
880 lid_t lid;
881 struct tlock *tlck;
883 TXN_LOCK();
885 for (lid = tblk->next; lid; lid = tlck->next) {
886 tlck = lid_to_tlock(lid);
887 if ((mp = tlck->mp) != NULL &&
888 (tlck->type & tlckBTROOT) == 0) {
889 assert(mp->xflag & COMMIT_PAGE);
890 mp->lid = 0;
895 * wakeup transactions waiting on a page locked
896 * by the current transaction
898 TXN_WAKEUP(&tblk->waitor);
900 TXN_UNLOCK();
904 * NAME: txUnlock()
906 * FUNCTION: Initiates pageout of pages modified by tid in journalled
907 * objects and frees their lockwords.
909 static void txUnlock(struct tblock * tblk)
911 struct tlock *tlck;
912 struct linelock *linelock;
913 lid_t lid, next, llid, k;
914 struct metapage *mp;
915 struct jfs_log *log;
916 int difft, diffp;
917 unsigned long flags;
919 jfs_info("txUnlock: tblk = 0x%p", tblk);
920 log = JFS_SBI(tblk->sb)->log;
923 * mark page under tlock homeok (its log has been written):
925 for (lid = tblk->next; lid; lid = next) {
926 tlck = lid_to_tlock(lid);
927 next = tlck->next;
929 jfs_info("unlocking lid = %d, tlck = 0x%p", lid, tlck);
931 /* unbind page from tlock */
932 if ((mp = tlck->mp) != NULL &&
933 (tlck->type & tlckBTROOT) == 0) {
934 assert(mp->xflag & COMMIT_PAGE);
936 /* hold buffer
938 hold_metapage(mp);
940 assert(mp->nohomeok > 0);
941 _metapage_homeok(mp);
943 /* inherit younger/larger clsn */
944 LOGSYNC_LOCK(log, flags);
945 if (mp->clsn) {
946 logdiff(difft, tblk->clsn, log);
947 logdiff(diffp, mp->clsn, log);
948 if (difft > diffp)
949 mp->clsn = tblk->clsn;
950 } else
951 mp->clsn = tblk->clsn;
952 LOGSYNC_UNLOCK(log, flags);
954 assert(!(tlck->flag & tlckFREEPAGE));
956 put_metapage(mp);
959 /* insert tlock, and linelock(s) of the tlock if any,
960 * at head of freelist
962 TXN_LOCK();
964 llid = ((struct linelock *) & tlck->lock)->next;
965 while (llid) {
966 linelock = (struct linelock *) lid_to_tlock(llid);
967 k = linelock->next;
968 txLockFree(llid);
969 llid = k;
971 txLockFree(lid);
973 TXN_UNLOCK();
975 tblk->next = tblk->last = 0;
978 * remove tblock from logsynclist
979 * (allocation map pages inherited lsn of tblk and
980 * has been inserted in logsync list at txUpdateMap())
982 if (tblk->lsn) {
983 LOGSYNC_LOCK(log, flags);
984 log->count--;
985 list_del(&tblk->synclist);
986 LOGSYNC_UNLOCK(log, flags);
991 * txMaplock()
993 * function: allocate a transaction lock for freed page/entry;
994 * for freed page, maplock is used as xtlock/dtlock type;
996 struct tlock *txMaplock(tid_t tid, struct inode *ip, int type)
998 struct jfs_inode_info *jfs_ip = JFS_IP(ip);
999 lid_t lid;
1000 struct tblock *tblk;
1001 struct tlock *tlck;
1002 struct maplock *maplock;
1004 TXN_LOCK();
1007 * allocate a tlock
1009 lid = txLockAlloc();
1010 tlck = lid_to_tlock(lid);
1013 * initialize tlock
1015 tlck->tid = tid;
1017 /* bind the tlock and the object */
1018 tlck->flag = tlckINODELOCK;
1019 if (S_ISDIR(ip->i_mode))
1020 tlck->flag |= tlckDIRECTORY;
1021 tlck->ip = ip;
1022 tlck->mp = NULL;
1024 tlck->type = type;
1027 * enqueue transaction lock to transaction/inode
1029 /* insert the tlock at tail of transaction tlock list */
1030 if (tid) {
1031 tblk = tid_to_tblock(tid);
1032 if (tblk->next)
1033 lid_to_tlock(tblk->last)->next = lid;
1034 else
1035 tblk->next = lid;
1036 tlck->next = 0;
1037 tblk->last = lid;
1039 /* anonymous transaction:
1040 * insert the tlock at head of inode anonymous tlock list
1042 else {
1043 tlck->next = jfs_ip->atlhead;
1044 jfs_ip->atlhead = lid;
1045 if (tlck->next == 0) {
1046 /* This inode's first anonymous transaction */
1047 jfs_ip->atltail = lid;
1048 list_add_tail(&jfs_ip->anon_inode_list,
1049 &TxAnchor.anon_list);
1053 TXN_UNLOCK();
1055 /* initialize type dependent area for maplock */
1056 maplock = (struct maplock *) & tlck->lock;
1057 maplock->next = 0;
1058 maplock->maxcnt = 0;
1059 maplock->index = 0;
1061 return tlck;
1065 * txLinelock()
1067 * function: allocate a transaction lock for log vector list
1069 struct linelock *txLinelock(struct linelock * tlock)
1071 lid_t lid;
1072 struct tlock *tlck;
1073 struct linelock *linelock;
1075 TXN_LOCK();
1077 /* allocate a TxLock structure */
1078 lid = txLockAlloc();
1079 tlck = lid_to_tlock(lid);
1081 TXN_UNLOCK();
1083 /* initialize linelock */
1084 linelock = (struct linelock *) tlck;
1085 linelock->next = 0;
1086 linelock->flag = tlckLINELOCK;
1087 linelock->maxcnt = TLOCKLONG;
1088 linelock->index = 0;
1089 if (tlck->flag & tlckDIRECTORY)
1090 linelock->flag |= tlckDIRECTORY;
1092 /* append linelock after tlock */
1093 linelock->next = tlock->next;
1094 tlock->next = lid;
1096 return linelock;
1100 * transaction commit management
1101 * -----------------------------
1105 * NAME: txCommit()
1107 * FUNCTION: commit the changes to the objects specified in
1108 * clist. For journalled segments only the
1109 * changes of the caller are committed, ie by tid.
1110 * for non-journalled segments the data are flushed to
1111 * disk and then the change to the disk inode and indirect
1112 * blocks committed (so blocks newly allocated to the
1113 * segment will be made a part of the segment atomically).
1115 * all of the segments specified in clist must be in
1116 * one file system. no more than 6 segments are needed
1117 * to handle all unix svcs.
1119 * if the i_nlink field (i.e. disk inode link count)
1120 * is zero, and the type of inode is a regular file or
1121 * directory, or symbolic link , the inode is truncated
1122 * to zero length. the truncation is committed but the
1123 * VM resources are unaffected until it is closed (see
1124 * iput and iclose).
1126 * PARAMETER:
1128 * RETURN:
1130 * serialization:
1131 * on entry the inode lock on each segment is assumed
1132 * to be held.
1134 * i/o error:
1136 int txCommit(tid_t tid, /* transaction identifier */
1137 int nip, /* number of inodes to commit */
1138 struct inode **iplist, /* list of inode to commit */
1139 int flag)
1141 int rc = 0;
1142 struct commit cd;
1143 struct jfs_log *log;
1144 struct tblock *tblk;
1145 struct lrd *lrd;
1146 int lsn;
1147 struct inode *ip;
1148 struct jfs_inode_info *jfs_ip;
1149 int k, n;
1150 ino_t top;
1151 struct super_block *sb;
1153 jfs_info("txCommit, tid = %d, flag = %d", tid, flag);
1154 /* is read-only file system ? */
1155 if (isReadOnly(iplist[0])) {
1156 rc = -EROFS;
1157 goto TheEnd;
1160 sb = cd.sb = iplist[0]->i_sb;
1161 cd.tid = tid;
1163 if (tid == 0)
1164 tid = txBegin(sb, 0);
1165 tblk = tid_to_tblock(tid);
1168 * initialize commit structure
1170 log = JFS_SBI(sb)->log;
1171 cd.log = log;
1173 /* initialize log record descriptor in commit */
1174 lrd = &cd.lrd;
1175 lrd->logtid = cpu_to_le32(tblk->logtid);
1176 lrd->backchain = 0;
1178 tblk->xflag |= flag;
1180 if ((flag & (COMMIT_FORCE | COMMIT_SYNC)) == 0)
1181 tblk->xflag |= COMMIT_LAZY;
1183 * prepare non-journaled objects for commit
1185 * flush data pages of non-journaled file
1186 * to prevent the file getting non-initialized disk blocks
1187 * in case of crash.
1188 * (new blocks - )
1190 cd.iplist = iplist;
1191 cd.nip = nip;
1194 * acquire transaction lock on (on-disk) inodes
1196 * update on-disk inode from in-memory inode
1197 * acquiring transaction locks for AFTER records
1198 * on the on-disk inode of file object
1200 * sort the inodes array by inode number in descending order
1201 * to prevent deadlock when acquiring transaction lock
1202 * of on-disk inodes on multiple on-disk inode pages by
1203 * multiple concurrent transactions
1205 for (k = 0; k < cd.nip; k++) {
1206 top = (cd.iplist[k])->i_ino;
1207 for (n = k + 1; n < cd.nip; n++) {
1208 ip = cd.iplist[n];
1209 if (ip->i_ino > top) {
1210 top = ip->i_ino;
1211 cd.iplist[n] = cd.iplist[k];
1212 cd.iplist[k] = ip;
1216 ip = cd.iplist[k];
1217 jfs_ip = JFS_IP(ip);
1220 * BUGBUG - This code has temporarily been removed. The
1221 * intent is to ensure that any file data is written before
1222 * the metadata is committed to the journal. This prevents
1223 * uninitialized data from appearing in a file after the
1224 * journal has been replayed. (The uninitialized data
1225 * could be sensitive data removed by another user.)
1227 * The problem now is that we are holding the IWRITELOCK
1228 * on the inode, and calling filemap_fdatawrite on an
1229 * unmapped page will cause a deadlock in jfs_get_block.
1231 * The long term solution is to pare down the use of
1232 * IWRITELOCK. We are currently holding it too long.
1233 * We could also be smarter about which data pages need
1234 * to be written before the transaction is committed and
1235 * when we don't need to worry about it at all.
1237 * if ((!S_ISDIR(ip->i_mode))
1238 * && (tblk->flag & COMMIT_DELETE) == 0)
1239 * filemap_write_and_wait(ip->i_mapping);
1243 * Mark inode as not dirty. It will still be on the dirty
1244 * inode list, but we'll know not to commit it again unless
1245 * it gets marked dirty again
1247 clear_cflag(COMMIT_Dirty, ip);
1249 /* inherit anonymous tlock(s) of inode */
1250 if (jfs_ip->atlhead) {
1251 lid_to_tlock(jfs_ip->atltail)->next = tblk->next;
1252 tblk->next = jfs_ip->atlhead;
1253 if (!tblk->last)
1254 tblk->last = jfs_ip->atltail;
1255 jfs_ip->atlhead = jfs_ip->atltail = 0;
1256 TXN_LOCK();
1257 list_del_init(&jfs_ip->anon_inode_list);
1258 TXN_UNLOCK();
1262 * acquire transaction lock on on-disk inode page
1263 * (become first tlock of the tblk's tlock list)
1265 if (((rc = diWrite(tid, ip))))
1266 goto out;
1270 * write log records from transaction locks
1272 * txUpdateMap() resets XAD_NEW in XAD.
1274 if ((rc = txLog(log, tblk, &cd)))
1275 goto TheEnd;
1278 * Ensure that inode isn't reused before
1279 * lazy commit thread finishes processing
1281 if (tblk->xflag & COMMIT_DELETE) {
1282 atomic_inc(&tblk->u.ip->i_count);
1284 * Avoid a rare deadlock
1286 * If the inode is locked, we may be blocked in
1287 * jfs_commit_inode. If so, we don't want the
1288 * lazy_commit thread doing the last iput() on the inode
1289 * since that may block on the locked inode. Instead,
1290 * commit the transaction synchronously, so the last iput
1291 * will be done by the calling thread (or later)
1293 if (tblk->u.ip->i_state & I_LOCK)
1294 tblk->xflag &= ~COMMIT_LAZY;
1297 ASSERT((!(tblk->xflag & COMMIT_DELETE)) ||
1298 ((tblk->u.ip->i_nlink == 0) &&
1299 !test_cflag(COMMIT_Nolink, tblk->u.ip)));
1302 * write COMMIT log record
1304 lrd->type = cpu_to_le16(LOG_COMMIT);
1305 lrd->length = 0;
1306 lsn = lmLog(log, tblk, lrd, NULL);
1308 lmGroupCommit(log, tblk);
1311 * - transaction is now committed -
1315 * force pages in careful update
1316 * (imap addressing structure update)
1318 if (flag & COMMIT_FORCE)
1319 txForce(tblk);
1322 * update allocation map.
1324 * update inode allocation map and inode:
1325 * free pager lock on memory object of inode if any.
1326 * update block allocation map.
1328 * txUpdateMap() resets XAD_NEW in XAD.
1330 if (tblk->xflag & COMMIT_FORCE)
1331 txUpdateMap(tblk);
1334 * free transaction locks and pageout/free pages
1336 txRelease(tblk);
1338 if ((tblk->flag & tblkGC_LAZY) == 0)
1339 txUnlock(tblk);
1343 * reset in-memory object state
1345 for (k = 0; k < cd.nip; k++) {
1346 ip = cd.iplist[k];
1347 jfs_ip = JFS_IP(ip);
1350 * reset in-memory inode state
1352 jfs_ip->bxflag = 0;
1353 jfs_ip->blid = 0;
1356 out:
1357 if (rc != 0)
1358 txAbort(tid, 1);
1360 TheEnd:
1361 jfs_info("txCommit: tid = %d, returning %d", tid, rc);
1362 return rc;
1366 * NAME: txLog()
1368 * FUNCTION: Writes AFTER log records for all lines modified
1369 * by tid for segments specified by inodes in comdata.
1370 * Code assumes only WRITELOCKS are recorded in lockwords.
1372 * PARAMETERS:
1374 * RETURN :
1376 static int txLog(struct jfs_log * log, struct tblock * tblk, struct commit * cd)
1378 int rc = 0;
1379 struct inode *ip;
1380 lid_t lid;
1381 struct tlock *tlck;
1382 struct lrd *lrd = &cd->lrd;
1385 * write log record(s) for each tlock of transaction,
1387 for (lid = tblk->next; lid; lid = tlck->next) {
1388 tlck = lid_to_tlock(lid);
1390 tlck->flag |= tlckLOG;
1392 /* initialize lrd common */
1393 ip = tlck->ip;
1394 lrd->aggregate = cpu_to_le32(JFS_SBI(ip->i_sb)->aggregate);
1395 lrd->log.redopage.fileset = cpu_to_le32(JFS_IP(ip)->fileset);
1396 lrd->log.redopage.inode = cpu_to_le32(ip->i_ino);
1398 /* write log record of page from the tlock */
1399 switch (tlck->type & tlckTYPE) {
1400 case tlckXTREE:
1401 xtLog(log, tblk, lrd, tlck);
1402 break;
1404 case tlckDTREE:
1405 dtLog(log, tblk, lrd, tlck);
1406 break;
1408 case tlckINODE:
1409 diLog(log, tblk, lrd, tlck, cd);
1410 break;
1412 case tlckMAP:
1413 mapLog(log, tblk, lrd, tlck);
1414 break;
1416 case tlckDATA:
1417 dataLog(log, tblk, lrd, tlck);
1418 break;
1420 default:
1421 jfs_err("UFO tlock:0x%p", tlck);
1425 return rc;
1429 * diLog()
1431 * function: log inode tlock and format maplock to update bmap;
1433 static int diLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
1434 struct tlock * tlck, struct commit * cd)
1436 int rc = 0;
1437 struct metapage *mp;
1438 pxd_t *pxd;
1439 struct pxd_lock *pxdlock;
1441 mp = tlck->mp;
1443 /* initialize as REDOPAGE record format */
1444 lrd->log.redopage.type = cpu_to_le16(LOG_INODE);
1445 lrd->log.redopage.l2linesize = cpu_to_le16(L2INODESLOTSIZE);
1447 pxd = &lrd->log.redopage.pxd;
1450 * inode after image
1452 if (tlck->type & tlckENTRY) {
1453 /* log after-image for logredo(): */
1454 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1455 PXDaddress(pxd, mp->index);
1456 PXDlength(pxd,
1457 mp->logical_size >> tblk->sb->s_blocksize_bits);
1458 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1460 /* mark page as homeward bound */
1461 tlck->flag |= tlckWRITEPAGE;
1462 } else if (tlck->type & tlckFREE) {
1464 * free inode extent
1466 * (pages of the freed inode extent have been invalidated and
1467 * a maplock for free of the extent has been formatted at
1468 * txLock() time);
1470 * the tlock had been acquired on the inode allocation map page
1471 * (iag) that specifies the freed extent, even though the map
1472 * page is not itself logged, to prevent pageout of the map
1473 * page before the log;
1476 /* log LOG_NOREDOINOEXT of the freed inode extent for
1477 * logredo() to start NoRedoPage filters, and to update
1478 * imap and bmap for free of the extent;
1480 lrd->type = cpu_to_le16(LOG_NOREDOINOEXT);
1482 * For the LOG_NOREDOINOEXT record, we need
1483 * to pass the IAG number and inode extent
1484 * index (within that IAG) from which the
1485 * the extent being released. These have been
1486 * passed to us in the iplist[1] and iplist[2].
1488 lrd->log.noredoinoext.iagnum =
1489 cpu_to_le32((u32) (size_t) cd->iplist[1]);
1490 lrd->log.noredoinoext.inoext_idx =
1491 cpu_to_le32((u32) (size_t) cd->iplist[2]);
1493 pxdlock = (struct pxd_lock *) & tlck->lock;
1494 *pxd = pxdlock->pxd;
1495 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL));
1497 /* update bmap */
1498 tlck->flag |= tlckUPDATEMAP;
1500 /* mark page as homeward bound */
1501 tlck->flag |= tlckWRITEPAGE;
1502 } else
1503 jfs_err("diLog: UFO type tlck:0x%p", tlck);
1504 #ifdef _JFS_WIP
1506 * alloc/free external EA extent
1508 * a maplock for txUpdateMap() to update bPWMAP for alloc/free
1509 * of the extent has been formatted at txLock() time;
1511 else {
1512 assert(tlck->type & tlckEA);
1514 /* log LOG_UPDATEMAP for logredo() to update bmap for
1515 * alloc of new (and free of old) external EA extent;
1517 lrd->type = cpu_to_le16(LOG_UPDATEMAP);
1518 pxdlock = (struct pxd_lock *) & tlck->lock;
1519 nlock = pxdlock->index;
1520 for (i = 0; i < nlock; i++, pxdlock++) {
1521 if (pxdlock->flag & mlckALLOCPXD)
1522 lrd->log.updatemap.type =
1523 cpu_to_le16(LOG_ALLOCPXD);
1524 else
1525 lrd->log.updatemap.type =
1526 cpu_to_le16(LOG_FREEPXD);
1527 lrd->log.updatemap.nxd = cpu_to_le16(1);
1528 lrd->log.updatemap.pxd = pxdlock->pxd;
1529 lrd->backchain =
1530 cpu_to_le32(lmLog(log, tblk, lrd, NULL));
1533 /* update bmap */
1534 tlck->flag |= tlckUPDATEMAP;
1536 #endif /* _JFS_WIP */
1538 return rc;
1542 * dataLog()
1544 * function: log data tlock
1546 static int dataLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
1547 struct tlock * tlck)
1549 struct metapage *mp;
1550 pxd_t *pxd;
1552 mp = tlck->mp;
1554 /* initialize as REDOPAGE record format */
1555 lrd->log.redopage.type = cpu_to_le16(LOG_DATA);
1556 lrd->log.redopage.l2linesize = cpu_to_le16(L2DATASLOTSIZE);
1558 pxd = &lrd->log.redopage.pxd;
1560 /* log after-image for logredo(): */
1561 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1563 if (jfs_dirtable_inline(tlck->ip)) {
1565 * The table has been truncated, we've must have deleted
1566 * the last entry, so don't bother logging this
1568 mp->lid = 0;
1569 grab_metapage(mp);
1570 metapage_homeok(mp);
1571 discard_metapage(mp);
1572 tlck->mp = NULL;
1573 return 0;
1576 PXDaddress(pxd, mp->index);
1577 PXDlength(pxd, mp->logical_size >> tblk->sb->s_blocksize_bits);
1579 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1581 /* mark page as homeward bound */
1582 tlck->flag |= tlckWRITEPAGE;
1584 return 0;
1588 * dtLog()
1590 * function: log dtree tlock and format maplock to update bmap;
1592 static void dtLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
1593 struct tlock * tlck)
1595 struct metapage *mp;
1596 struct pxd_lock *pxdlock;
1597 pxd_t *pxd;
1599 mp = tlck->mp;
1601 /* initialize as REDOPAGE/NOREDOPAGE record format */
1602 lrd->log.redopage.type = cpu_to_le16(LOG_DTREE);
1603 lrd->log.redopage.l2linesize = cpu_to_le16(L2DTSLOTSIZE);
1605 pxd = &lrd->log.redopage.pxd;
1607 if (tlck->type & tlckBTROOT)
1608 lrd->log.redopage.type |= cpu_to_le16(LOG_BTROOT);
1611 * page extension via relocation: entry insertion;
1612 * page extension in-place: entry insertion;
1613 * new right page from page split, reinitialized in-line
1614 * root from root page split: entry insertion;
1616 if (tlck->type & (tlckNEW | tlckEXTEND)) {
1617 /* log after-image of the new page for logredo():
1618 * mark log (LOG_NEW) for logredo() to initialize
1619 * freelist and update bmap for alloc of the new page;
1621 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1622 if (tlck->type & tlckEXTEND)
1623 lrd->log.redopage.type |= cpu_to_le16(LOG_EXTEND);
1624 else
1625 lrd->log.redopage.type |= cpu_to_le16(LOG_NEW);
1626 PXDaddress(pxd, mp->index);
1627 PXDlength(pxd,
1628 mp->logical_size >> tblk->sb->s_blocksize_bits);
1629 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1631 /* format a maplock for txUpdateMap() to update bPMAP for
1632 * alloc of the new page;
1634 if (tlck->type & tlckBTROOT)
1635 return;
1636 tlck->flag |= tlckUPDATEMAP;
1637 pxdlock = (struct pxd_lock *) & tlck->lock;
1638 pxdlock->flag = mlckALLOCPXD;
1639 pxdlock->pxd = *pxd;
1641 pxdlock->index = 1;
1643 /* mark page as homeward bound */
1644 tlck->flag |= tlckWRITEPAGE;
1645 return;
1649 * entry insertion/deletion,
1650 * sibling page link update (old right page before split);
1652 if (tlck->type & (tlckENTRY | tlckRELINK)) {
1653 /* log after-image for logredo(): */
1654 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1655 PXDaddress(pxd, mp->index);
1656 PXDlength(pxd,
1657 mp->logical_size >> tblk->sb->s_blocksize_bits);
1658 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1660 /* mark page as homeward bound */
1661 tlck->flag |= tlckWRITEPAGE;
1662 return;
1666 * page deletion: page has been invalidated
1667 * page relocation: source extent
1669 * a maplock for free of the page has been formatted
1670 * at txLock() time);
1672 if (tlck->type & (tlckFREE | tlckRELOCATE)) {
1673 /* log LOG_NOREDOPAGE of the deleted page for logredo()
1674 * to start NoRedoPage filter and to update bmap for free
1675 * of the deletd page
1677 lrd->type = cpu_to_le16(LOG_NOREDOPAGE);
1678 pxdlock = (struct pxd_lock *) & tlck->lock;
1679 *pxd = pxdlock->pxd;
1680 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL));
1682 /* a maplock for txUpdateMap() for free of the page
1683 * has been formatted at txLock() time;
1685 tlck->flag |= tlckUPDATEMAP;
1687 return;
1691 * xtLog()
1693 * function: log xtree tlock and format maplock to update bmap;
1695 static void xtLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
1696 struct tlock * tlck)
1698 struct inode *ip;
1699 struct metapage *mp;
1700 xtpage_t *p;
1701 struct xtlock *xtlck;
1702 struct maplock *maplock;
1703 struct xdlistlock *xadlock;
1704 struct pxd_lock *pxdlock;
1705 pxd_t *page_pxd;
1706 int next, lwm, hwm;
1708 ip = tlck->ip;
1709 mp = tlck->mp;
1711 /* initialize as REDOPAGE/NOREDOPAGE record format */
1712 lrd->log.redopage.type = cpu_to_le16(LOG_XTREE);
1713 lrd->log.redopage.l2linesize = cpu_to_le16(L2XTSLOTSIZE);
1715 page_pxd = &lrd->log.redopage.pxd;
1717 if (tlck->type & tlckBTROOT) {
1718 lrd->log.redopage.type |= cpu_to_le16(LOG_BTROOT);
1719 p = &JFS_IP(ip)->i_xtroot;
1720 if (S_ISDIR(ip->i_mode))
1721 lrd->log.redopage.type |=
1722 cpu_to_le16(LOG_DIR_XTREE);
1723 } else
1724 p = (xtpage_t *) mp->data;
1725 next = le16_to_cpu(p->header.nextindex);
1727 xtlck = (struct xtlock *) & tlck->lock;
1729 maplock = (struct maplock *) & tlck->lock;
1730 xadlock = (struct xdlistlock *) maplock;
1733 * entry insertion/extension;
1734 * sibling page link update (old right page before split);
1736 if (tlck->type & (tlckNEW | tlckGROW | tlckRELINK)) {
1737 /* log after-image for logredo():
1738 * logredo() will update bmap for alloc of new/extended
1739 * extents (XAD_NEW|XAD_EXTEND) of XAD[lwm:next) from
1740 * after-image of XADlist;
1741 * logredo() resets (XAD_NEW|XAD_EXTEND) flag when
1742 * applying the after-image to the meta-data page.
1744 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1745 PXDaddress(page_pxd, mp->index);
1746 PXDlength(page_pxd,
1747 mp->logical_size >> tblk->sb->s_blocksize_bits);
1748 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1750 /* format a maplock for txUpdateMap() to update bPMAP
1751 * for alloc of new/extended extents of XAD[lwm:next)
1752 * from the page itself;
1753 * txUpdateMap() resets (XAD_NEW|XAD_EXTEND) flag.
1755 lwm = xtlck->lwm.offset;
1756 if (lwm == 0)
1757 lwm = XTPAGEMAXSLOT;
1759 if (lwm == next)
1760 goto out;
1761 if (lwm > next) {
1762 jfs_err("xtLog: lwm > next\n");
1763 goto out;
1765 tlck->flag |= tlckUPDATEMAP;
1766 xadlock->flag = mlckALLOCXADLIST;
1767 xadlock->count = next - lwm;
1768 if ((xadlock->count <= 4) && (tblk->xflag & COMMIT_LAZY)) {
1769 int i;
1770 pxd_t *pxd;
1772 * Lazy commit may allow xtree to be modified before
1773 * txUpdateMap runs. Copy xad into linelock to
1774 * preserve correct data.
1776 * We can fit twice as may pxd's as xads in the lock
1778 xadlock->flag = mlckALLOCPXDLIST;
1779 pxd = xadlock->xdlist = &xtlck->pxdlock;
1780 for (i = 0; i < xadlock->count; i++) {
1781 PXDaddress(pxd, addressXAD(&p->xad[lwm + i]));
1782 PXDlength(pxd, lengthXAD(&p->xad[lwm + i]));
1783 p->xad[lwm + i].flag &=
1784 ~(XAD_NEW | XAD_EXTENDED);
1785 pxd++;
1787 } else {
1789 * xdlist will point to into inode's xtree, ensure
1790 * that transaction is not committed lazily.
1792 xadlock->flag = mlckALLOCXADLIST;
1793 xadlock->xdlist = &p->xad[lwm];
1794 tblk->xflag &= ~COMMIT_LAZY;
1796 jfs_info("xtLog: alloc ip:0x%p mp:0x%p tlck:0x%p lwm:%d "
1797 "count:%d", tlck->ip, mp, tlck, lwm, xadlock->count);
1799 maplock->index = 1;
1801 out:
1802 /* mark page as homeward bound */
1803 tlck->flag |= tlckWRITEPAGE;
1805 return;
1809 * page deletion: file deletion/truncation (ref. xtTruncate())
1811 * (page will be invalidated after log is written and bmap
1812 * is updated from the page);
1814 if (tlck->type & tlckFREE) {
1815 /* LOG_NOREDOPAGE log for NoRedoPage filter:
1816 * if page free from file delete, NoRedoFile filter from
1817 * inode image of zero link count will subsume NoRedoPage
1818 * filters for each page;
1819 * if page free from file truncattion, write NoRedoPage
1820 * filter;
1822 * upadte of block allocation map for the page itself:
1823 * if page free from deletion and truncation, LOG_UPDATEMAP
1824 * log for the page itself is generated from processing
1825 * its parent page xad entries;
1827 /* if page free from file truncation, log LOG_NOREDOPAGE
1828 * of the deleted page for logredo() to start NoRedoPage
1829 * filter for the page;
1831 if (tblk->xflag & COMMIT_TRUNCATE) {
1832 /* write NOREDOPAGE for the page */
1833 lrd->type = cpu_to_le16(LOG_NOREDOPAGE);
1834 PXDaddress(page_pxd, mp->index);
1835 PXDlength(page_pxd,
1836 mp->logical_size >> tblk->sb->
1837 s_blocksize_bits);
1838 lrd->backchain =
1839 cpu_to_le32(lmLog(log, tblk, lrd, NULL));
1841 if (tlck->type & tlckBTROOT) {
1842 /* Empty xtree must be logged */
1843 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1844 lrd->backchain =
1845 cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1849 /* init LOG_UPDATEMAP of the freed extents
1850 * XAD[XTENTRYSTART:hwm) from the deleted page itself
1851 * for logredo() to update bmap;
1853 lrd->type = cpu_to_le16(LOG_UPDATEMAP);
1854 lrd->log.updatemap.type = cpu_to_le16(LOG_FREEXADLIST);
1855 xtlck = (struct xtlock *) & tlck->lock;
1856 hwm = xtlck->hwm.offset;
1857 lrd->log.updatemap.nxd =
1858 cpu_to_le16(hwm - XTENTRYSTART + 1);
1859 /* reformat linelock for lmLog() */
1860 xtlck->header.offset = XTENTRYSTART;
1861 xtlck->header.length = hwm - XTENTRYSTART + 1;
1862 xtlck->index = 1;
1863 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1865 /* format a maplock for txUpdateMap() to update bmap
1866 * to free extents of XAD[XTENTRYSTART:hwm) from the
1867 * deleted page itself;
1869 tlck->flag |= tlckUPDATEMAP;
1870 xadlock->count = hwm - XTENTRYSTART + 1;
1871 if ((xadlock->count <= 4) && (tblk->xflag & COMMIT_LAZY)) {
1872 int i;
1873 pxd_t *pxd;
1875 * Lazy commit may allow xtree to be modified before
1876 * txUpdateMap runs. Copy xad into linelock to
1877 * preserve correct data.
1879 * We can fit twice as may pxd's as xads in the lock
1881 xadlock->flag = mlckFREEPXDLIST;
1882 pxd = xadlock->xdlist = &xtlck->pxdlock;
1883 for (i = 0; i < xadlock->count; i++) {
1884 PXDaddress(pxd,
1885 addressXAD(&p->xad[XTENTRYSTART + i]));
1886 PXDlength(pxd,
1887 lengthXAD(&p->xad[XTENTRYSTART + i]));
1888 pxd++;
1890 } else {
1892 * xdlist will point to into inode's xtree, ensure
1893 * that transaction is not committed lazily.
1895 xadlock->flag = mlckFREEXADLIST;
1896 xadlock->xdlist = &p->xad[XTENTRYSTART];
1897 tblk->xflag &= ~COMMIT_LAZY;
1899 jfs_info("xtLog: free ip:0x%p mp:0x%p count:%d lwm:2",
1900 tlck->ip, mp, xadlock->count);
1902 maplock->index = 1;
1904 /* mark page as invalid */
1905 if (((tblk->xflag & COMMIT_PWMAP) || S_ISDIR(ip->i_mode))
1906 && !(tlck->type & tlckBTROOT))
1907 tlck->flag |= tlckFREEPAGE;
1909 else (tblk->xflag & COMMIT_PMAP)
1910 ? release the page;
1912 return;
1916 * page/entry truncation: file truncation (ref. xtTruncate())
1918 * |----------+------+------+---------------|
1919 * | | |
1920 * | | hwm - hwm before truncation
1921 * | next - truncation point
1922 * lwm - lwm before truncation
1923 * header ?
1925 if (tlck->type & tlckTRUNCATE) {
1926 /* This odd declaration suppresses a bogus gcc warning */
1927 pxd_t pxd = pxd; /* truncated extent of xad */
1928 int twm;
1931 * For truncation the entire linelock may be used, so it would
1932 * be difficult to store xad list in linelock itself.
1933 * Therefore, we'll just force transaction to be committed
1934 * synchronously, so that xtree pages won't be changed before
1935 * txUpdateMap runs.
1937 tblk->xflag &= ~COMMIT_LAZY;
1938 lwm = xtlck->lwm.offset;
1939 if (lwm == 0)
1940 lwm = XTPAGEMAXSLOT;
1941 hwm = xtlck->hwm.offset;
1942 twm = xtlck->twm.offset;
1945 * write log records
1947 /* log after-image for logredo():
1949 * logredo() will update bmap for alloc of new/extended
1950 * extents (XAD_NEW|XAD_EXTEND) of XAD[lwm:next) from
1951 * after-image of XADlist;
1952 * logredo() resets (XAD_NEW|XAD_EXTEND) flag when
1953 * applying the after-image to the meta-data page.
1955 lrd->type = cpu_to_le16(LOG_REDOPAGE);
1956 PXDaddress(page_pxd, mp->index);
1957 PXDlength(page_pxd,
1958 mp->logical_size >> tblk->sb->s_blocksize_bits);
1959 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck));
1962 * truncate entry XAD[twm == next - 1]:
1964 if (twm == next - 1) {
1965 /* init LOG_UPDATEMAP for logredo() to update bmap for
1966 * free of truncated delta extent of the truncated
1967 * entry XAD[next - 1]:
1968 * (xtlck->pxdlock = truncated delta extent);
1970 pxdlock = (struct pxd_lock *) & xtlck->pxdlock;
1971 /* assert(pxdlock->type & tlckTRUNCATE); */
1972 lrd->type = cpu_to_le16(LOG_UPDATEMAP);
1973 lrd->log.updatemap.type = cpu_to_le16(LOG_FREEPXD);
1974 lrd->log.updatemap.nxd = cpu_to_le16(1);
1975 lrd->log.updatemap.pxd = pxdlock->pxd;
1976 pxd = pxdlock->pxd; /* save to format maplock */
1977 lrd->backchain =
1978 cpu_to_le32(lmLog(log, tblk, lrd, NULL));
1982 * free entries XAD[next:hwm]:
1984 if (hwm >= next) {
1985 /* init LOG_UPDATEMAP of the freed extents
1986 * XAD[next:hwm] from the deleted page itself
1987 * for logredo() to update bmap;
1989 lrd->type = cpu_to_le16(LOG_UPDATEMAP);
1990 lrd->log.updatemap.type =
1991 cpu_to_le16(LOG_FREEXADLIST);
1992 xtlck = (struct xtlock *) & tlck->lock;
1993 hwm = xtlck->hwm.offset;
1994 lrd->log.updatemap.nxd =
1995 cpu_to_le16(hwm - next + 1);
1996 /* reformat linelock for lmLog() */
1997 xtlck->header.offset = next;
1998 xtlck->header.length = hwm - next + 1;
1999 xtlck->index = 1;
2000 lrd->backchain =
2001 cpu_to_le32(lmLog(log, tblk, lrd, tlck));
2005 * format maplock(s) for txUpdateMap() to update bmap
2007 maplock->index = 0;
2010 * allocate entries XAD[lwm:next):
2012 if (lwm < next) {
2013 /* format a maplock for txUpdateMap() to update bPMAP
2014 * for alloc of new/extended extents of XAD[lwm:next)
2015 * from the page itself;
2016 * txUpdateMap() resets (XAD_NEW|XAD_EXTEND) flag.
2018 tlck->flag |= tlckUPDATEMAP;
2019 xadlock->flag = mlckALLOCXADLIST;
2020 xadlock->count = next - lwm;
2021 xadlock->xdlist = &p->xad[lwm];
2023 jfs_info("xtLog: alloc ip:0x%p mp:0x%p count:%d "
2024 "lwm:%d next:%d",
2025 tlck->ip, mp, xadlock->count, lwm, next);
2026 maplock->index++;
2027 xadlock++;
2031 * truncate entry XAD[twm == next - 1]:
2033 if (twm == next - 1) {
2034 /* format a maplock for txUpdateMap() to update bmap
2035 * to free truncated delta extent of the truncated
2036 * entry XAD[next - 1];
2037 * (xtlck->pxdlock = truncated delta extent);
2039 tlck->flag |= tlckUPDATEMAP;
2040 pxdlock = (struct pxd_lock *) xadlock;
2041 pxdlock->flag = mlckFREEPXD;
2042 pxdlock->count = 1;
2043 pxdlock->pxd = pxd;
2045 jfs_info("xtLog: truncate ip:0x%p mp:0x%p count:%d "
2046 "hwm:%d", ip, mp, pxdlock->count, hwm);
2047 maplock->index++;
2048 xadlock++;
2052 * free entries XAD[next:hwm]:
2054 if (hwm >= next) {
2055 /* format a maplock for txUpdateMap() to update bmap
2056 * to free extents of XAD[next:hwm] from thedeleted
2057 * page itself;
2059 tlck->flag |= tlckUPDATEMAP;
2060 xadlock->flag = mlckFREEXADLIST;
2061 xadlock->count = hwm - next + 1;
2062 xadlock->xdlist = &p->xad[next];
2064 jfs_info("xtLog: free ip:0x%p mp:0x%p count:%d "
2065 "next:%d hwm:%d",
2066 tlck->ip, mp, xadlock->count, next, hwm);
2067 maplock->index++;
2070 /* mark page as homeward bound */
2071 tlck->flag |= tlckWRITEPAGE;
2073 return;
2077 * mapLog()
2079 * function: log from maplock of freed data extents;
2081 static void mapLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd,
2082 struct tlock * tlck)
2084 struct pxd_lock *pxdlock;
2085 int i, nlock;
2086 pxd_t *pxd;
2089 * page relocation: free the source page extent
2091 * a maplock for txUpdateMap() for free of the page
2092 * has been formatted at txLock() time saving the src
2093 * relocated page address;
2095 if (tlck->type & tlckRELOCATE) {
2096 /* log LOG_NOREDOPAGE of the old relocated page
2097 * for logredo() to start NoRedoPage filter;
2099 lrd->type = cpu_to_le16(LOG_NOREDOPAGE);
2100 pxdlock = (struct pxd_lock *) & tlck->lock;
2101 pxd = &lrd->log.redopage.pxd;
2102 *pxd = pxdlock->pxd;
2103 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL));
2105 /* (N.B. currently, logredo() does NOT update bmap
2106 * for free of the page itself for (LOG_XTREE|LOG_NOREDOPAGE);
2107 * if page free from relocation, LOG_UPDATEMAP log is
2108 * specifically generated now for logredo()
2109 * to update bmap for free of src relocated page;
2110 * (new flag LOG_RELOCATE may be introduced which will
2111 * inform logredo() to start NORedoPage filter and also
2112 * update block allocation map at the same time, thus
2113 * avoiding an extra log write);
2115 lrd->type = cpu_to_le16(LOG_UPDATEMAP);
2116 lrd->log.updatemap.type = cpu_to_le16(LOG_FREEPXD);
2117 lrd->log.updatemap.nxd = cpu_to_le16(1);
2118 lrd->log.updatemap.pxd = pxdlock->pxd;
2119 lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL));
2121 /* a maplock for txUpdateMap() for free of the page
2122 * has been formatted at txLock() time;
2124 tlck->flag |= tlckUPDATEMAP;
2125 return;
2129 * Otherwise it's not a relocate request
2132 else {
2133 /* log LOG_UPDATEMAP for logredo() to update bmap for
2134 * free of truncated/relocated delta extent of the data;
2135 * e.g.: external EA extent, relocated/truncated extent
2136 * from xtTailgate();
2138 lrd->type = cpu_to_le16(LOG_UPDATEMAP);
2139 pxdlock = (struct pxd_lock *) & tlck->lock;
2140 nlock = pxdlock->index;
2141 for (i = 0; i < nlock; i++, pxdlock++) {
2142 if (pxdlock->flag & mlckALLOCPXD)
2143 lrd->log.updatemap.type =
2144 cpu_to_le16(LOG_ALLOCPXD);
2145 else
2146 lrd->log.updatemap.type =
2147 cpu_to_le16(LOG_FREEPXD);
2148 lrd->log.updatemap.nxd = cpu_to_le16(1);
2149 lrd->log.updatemap.pxd = pxdlock->pxd;
2150 lrd->backchain =
2151 cpu_to_le32(lmLog(log, tblk, lrd, NULL));
2152 jfs_info("mapLog: xaddr:0x%lx xlen:0x%x",
2153 (ulong) addressPXD(&pxdlock->pxd),
2154 lengthPXD(&pxdlock->pxd));
2157 /* update bmap */
2158 tlck->flag |= tlckUPDATEMAP;
2163 * txEA()
2165 * function: acquire maplock for EA/ACL extents or
2166 * set COMMIT_INLINE flag;
2168 void txEA(tid_t tid, struct inode *ip, dxd_t * oldea, dxd_t * newea)
2170 struct tlock *tlck = NULL;
2171 struct pxd_lock *maplock = NULL, *pxdlock = NULL;
2174 * format maplock for alloc of new EA extent
2176 if (newea) {
2177 /* Since the newea could be a completely zeroed entry we need to
2178 * check for the two flags which indicate we should actually
2179 * commit new EA data
2181 if (newea->flag & DXD_EXTENT) {
2182 tlck = txMaplock(tid, ip, tlckMAP);
2183 maplock = (struct pxd_lock *) & tlck->lock;
2184 pxdlock = (struct pxd_lock *) maplock;
2185 pxdlock->flag = mlckALLOCPXD;
2186 PXDaddress(&pxdlock->pxd, addressDXD(newea));
2187 PXDlength(&pxdlock->pxd, lengthDXD(newea));
2188 pxdlock++;
2189 maplock->index = 1;
2190 } else if (newea->flag & DXD_INLINE) {
2191 tlck = NULL;
2193 set_cflag(COMMIT_Inlineea, ip);
2198 * format maplock for free of old EA extent
2200 if (!test_cflag(COMMIT_Nolink, ip) && oldea->flag & DXD_EXTENT) {
2201 if (tlck == NULL) {
2202 tlck = txMaplock(tid, ip, tlckMAP);
2203 maplock = (struct pxd_lock *) & tlck->lock;
2204 pxdlock = (struct pxd_lock *) maplock;
2205 maplock->index = 0;
2207 pxdlock->flag = mlckFREEPXD;
2208 PXDaddress(&pxdlock->pxd, addressDXD(oldea));
2209 PXDlength(&pxdlock->pxd, lengthDXD(oldea));
2210 maplock->index++;
2215 * txForce()
2217 * function: synchronously write pages locked by transaction
2218 * after txLog() but before txUpdateMap();
2220 static void txForce(struct tblock * tblk)
2222 struct tlock *tlck;
2223 lid_t lid, next;
2224 struct metapage *mp;
2227 * reverse the order of transaction tlocks in
2228 * careful update order of address index pages
2229 * (right to left, bottom up)
2231 tlck = lid_to_tlock(tblk->next);
2232 lid = tlck->next;
2233 tlck->next = 0;
2234 while (lid) {
2235 tlck = lid_to_tlock(lid);
2236 next = tlck->next;
2237 tlck->next = tblk->next;
2238 tblk->next = lid;
2239 lid = next;
2243 * synchronously write the page, and
2244 * hold the page for txUpdateMap();
2246 for (lid = tblk->next; lid; lid = next) {
2247 tlck = lid_to_tlock(lid);
2248 next = tlck->next;
2250 if ((mp = tlck->mp) != NULL &&
2251 (tlck->type & tlckBTROOT) == 0) {
2252 assert(mp->xflag & COMMIT_PAGE);
2254 if (tlck->flag & tlckWRITEPAGE) {
2255 tlck->flag &= ~tlckWRITEPAGE;
2257 /* do not release page to freelist */
2258 force_metapage(mp);
2259 #if 0
2261 * The "right" thing to do here is to
2262 * synchronously write the metadata.
2263 * With the current implementation this
2264 * is hard since write_metapage requires
2265 * us to kunmap & remap the page. If we
2266 * have tlocks pointing into the metadata
2267 * pages, we don't want to do this. I think
2268 * we can get by with synchronously writing
2269 * the pages when they are released.
2271 assert(mp->nohomeok);
2272 set_bit(META_dirty, &mp->flag);
2273 set_bit(META_sync, &mp->flag);
2274 #endif
2281 * txUpdateMap()
2283 * function: update persistent allocation map (and working map
2284 * if appropriate);
2286 * parameter:
2288 static void txUpdateMap(struct tblock * tblk)
2290 struct inode *ip;
2291 struct inode *ipimap;
2292 lid_t lid;
2293 struct tlock *tlck;
2294 struct maplock *maplock;
2295 struct pxd_lock pxdlock;
2296 int maptype;
2297 int k, nlock;
2298 struct metapage *mp = NULL;
2300 ipimap = JFS_SBI(tblk->sb)->ipimap;
2302 maptype = (tblk->xflag & COMMIT_PMAP) ? COMMIT_PMAP : COMMIT_PWMAP;
2306 * update block allocation map
2308 * update allocation state in pmap (and wmap) and
2309 * update lsn of the pmap page;
2312 * scan each tlock/page of transaction for block allocation/free:
2314 * for each tlock/page of transaction, update map.
2315 * ? are there tlock for pmap and pwmap at the same time ?
2317 for (lid = tblk->next; lid; lid = tlck->next) {
2318 tlck = lid_to_tlock(lid);
2320 if ((tlck->flag & tlckUPDATEMAP) == 0)
2321 continue;
2323 if (tlck->flag & tlckFREEPAGE) {
2325 * Another thread may attempt to reuse freed space
2326 * immediately, so we want to get rid of the metapage
2327 * before anyone else has a chance to get it.
2328 * Lock metapage, update maps, then invalidate
2329 * the metapage.
2331 mp = tlck->mp;
2332 ASSERT(mp->xflag & COMMIT_PAGE);
2333 grab_metapage(mp);
2337 * extent list:
2338 * . in-line PXD list:
2339 * . out-of-line XAD list:
2341 maplock = (struct maplock *) & tlck->lock;
2342 nlock = maplock->index;
2344 for (k = 0; k < nlock; k++, maplock++) {
2346 * allocate blocks in persistent map:
2348 * blocks have been allocated from wmap at alloc time;
2350 if (maplock->flag & mlckALLOC) {
2351 txAllocPMap(ipimap, maplock, tblk);
2354 * free blocks in persistent and working map:
2355 * blocks will be freed in pmap and then in wmap;
2357 * ? tblock specifies the PMAP/PWMAP based upon
2358 * transaction
2360 * free blocks in persistent map:
2361 * blocks will be freed from wmap at last reference
2362 * release of the object for regular files;
2364 * Alway free blocks from both persistent & working
2365 * maps for directories
2367 else { /* (maplock->flag & mlckFREE) */
2369 if (tlck->flag & tlckDIRECTORY)
2370 txFreeMap(ipimap, maplock,
2371 tblk, COMMIT_PWMAP);
2372 else
2373 txFreeMap(ipimap, maplock,
2374 tblk, maptype);
2377 if (tlck->flag & tlckFREEPAGE) {
2378 if (!(tblk->flag & tblkGC_LAZY)) {
2379 /* This is equivalent to txRelease */
2380 ASSERT(mp->lid == lid);
2381 tlck->mp->lid = 0;
2383 assert(mp->nohomeok == 1);
2384 metapage_homeok(mp);
2385 discard_metapage(mp);
2386 tlck->mp = NULL;
2390 * update inode allocation map
2392 * update allocation state in pmap and
2393 * update lsn of the pmap page;
2394 * update in-memory inode flag/state
2396 * unlock mapper/write lock
2398 if (tblk->xflag & COMMIT_CREATE) {
2399 diUpdatePMap(ipimap, tblk->ino, false, tblk);
2400 /* update persistent block allocation map
2401 * for the allocation of inode extent;
2403 pxdlock.flag = mlckALLOCPXD;
2404 pxdlock.pxd = tblk->u.ixpxd;
2405 pxdlock.index = 1;
2406 txAllocPMap(ipimap, (struct maplock *) & pxdlock, tblk);
2407 } else if (tblk->xflag & COMMIT_DELETE) {
2408 ip = tblk->u.ip;
2409 diUpdatePMap(ipimap, ip->i_ino, true, tblk);
2410 iput(ip);
2415 * txAllocPMap()
2417 * function: allocate from persistent map;
2419 * parameter:
2420 * ipbmap -
2421 * malock -
2422 * xad list:
2423 * pxd:
2425 * maptype -
2426 * allocate from persistent map;
2427 * free from persistent map;
2428 * (e.g., tmp file - free from working map at releae
2429 * of last reference);
2430 * free from persistent and working map;
2432 * lsn - log sequence number;
2434 static void txAllocPMap(struct inode *ip, struct maplock * maplock,
2435 struct tblock * tblk)
2437 struct inode *ipbmap = JFS_SBI(ip->i_sb)->ipbmap;
2438 struct xdlistlock *xadlistlock;
2439 xad_t *xad;
2440 s64 xaddr;
2441 int xlen;
2442 struct pxd_lock *pxdlock;
2443 struct xdlistlock *pxdlistlock;
2444 pxd_t *pxd;
2445 int n;
2448 * allocate from persistent map;
2450 if (maplock->flag & mlckALLOCXADLIST) {
2451 xadlistlock = (struct xdlistlock *) maplock;
2452 xad = xadlistlock->xdlist;
2453 for (n = 0; n < xadlistlock->count; n++, xad++) {
2454 if (xad->flag & (XAD_NEW | XAD_EXTENDED)) {
2455 xaddr = addressXAD(xad);
2456 xlen = lengthXAD(xad);
2457 dbUpdatePMap(ipbmap, false, xaddr,
2458 (s64) xlen, tblk);
2459 xad->flag &= ~(XAD_NEW | XAD_EXTENDED);
2460 jfs_info("allocPMap: xaddr:0x%lx xlen:%d",
2461 (ulong) xaddr, xlen);
2464 } else if (maplock->flag & mlckALLOCPXD) {
2465 pxdlock = (struct pxd_lock *) maplock;
2466 xaddr = addressPXD(&pxdlock->pxd);
2467 xlen = lengthPXD(&pxdlock->pxd);
2468 dbUpdatePMap(ipbmap, false, xaddr, (s64) xlen, tblk);
2469 jfs_info("allocPMap: xaddr:0x%lx xlen:%d", (ulong) xaddr, xlen);
2470 } else { /* (maplock->flag & mlckALLOCPXDLIST) */
2472 pxdlistlock = (struct xdlistlock *) maplock;
2473 pxd = pxdlistlock->xdlist;
2474 for (n = 0; n < pxdlistlock->count; n++, pxd++) {
2475 xaddr = addressPXD(pxd);
2476 xlen = lengthPXD(pxd);
2477 dbUpdatePMap(ipbmap, false, xaddr, (s64) xlen,
2478 tblk);
2479 jfs_info("allocPMap: xaddr:0x%lx xlen:%d",
2480 (ulong) xaddr, xlen);
2486 * txFreeMap()
2488 * function: free from persistent and/or working map;
2490 * todo: optimization
2492 void txFreeMap(struct inode *ip,
2493 struct maplock * maplock, struct tblock * tblk, int maptype)
2495 struct inode *ipbmap = JFS_SBI(ip->i_sb)->ipbmap;
2496 struct xdlistlock *xadlistlock;
2497 xad_t *xad;
2498 s64 xaddr;
2499 int xlen;
2500 struct pxd_lock *pxdlock;
2501 struct xdlistlock *pxdlistlock;
2502 pxd_t *pxd;
2503 int n;
2505 jfs_info("txFreeMap: tblk:0x%p maplock:0x%p maptype:0x%x",
2506 tblk, maplock, maptype);
2509 * free from persistent map;
2511 if (maptype == COMMIT_PMAP || maptype == COMMIT_PWMAP) {
2512 if (maplock->flag & mlckFREEXADLIST) {
2513 xadlistlock = (struct xdlistlock *) maplock;
2514 xad = xadlistlock->xdlist;
2515 for (n = 0; n < xadlistlock->count; n++, xad++) {
2516 if (!(xad->flag & XAD_NEW)) {
2517 xaddr = addressXAD(xad);
2518 xlen = lengthXAD(xad);
2519 dbUpdatePMap(ipbmap, true, xaddr,
2520 (s64) xlen, tblk);
2521 jfs_info("freePMap: xaddr:0x%lx "
2522 "xlen:%d",
2523 (ulong) xaddr, xlen);
2526 } else if (maplock->flag & mlckFREEPXD) {
2527 pxdlock = (struct pxd_lock *) maplock;
2528 xaddr = addressPXD(&pxdlock->pxd);
2529 xlen = lengthPXD(&pxdlock->pxd);
2530 dbUpdatePMap(ipbmap, true, xaddr, (s64) xlen,
2531 tblk);
2532 jfs_info("freePMap: xaddr:0x%lx xlen:%d",
2533 (ulong) xaddr, xlen);
2534 } else { /* (maplock->flag & mlckALLOCPXDLIST) */
2536 pxdlistlock = (struct xdlistlock *) maplock;
2537 pxd = pxdlistlock->xdlist;
2538 for (n = 0; n < pxdlistlock->count; n++, pxd++) {
2539 xaddr = addressPXD(pxd);
2540 xlen = lengthPXD(pxd);
2541 dbUpdatePMap(ipbmap, true, xaddr,
2542 (s64) xlen, tblk);
2543 jfs_info("freePMap: xaddr:0x%lx xlen:%d",
2544 (ulong) xaddr, xlen);
2550 * free from working map;
2552 if (maptype == COMMIT_PWMAP || maptype == COMMIT_WMAP) {
2553 if (maplock->flag & mlckFREEXADLIST) {
2554 xadlistlock = (struct xdlistlock *) maplock;
2555 xad = xadlistlock->xdlist;
2556 for (n = 0; n < xadlistlock->count; n++, xad++) {
2557 xaddr = addressXAD(xad);
2558 xlen = lengthXAD(xad);
2559 dbFree(ip, xaddr, (s64) xlen);
2560 xad->flag = 0;
2561 jfs_info("freeWMap: xaddr:0x%lx xlen:%d",
2562 (ulong) xaddr, xlen);
2564 } else if (maplock->flag & mlckFREEPXD) {
2565 pxdlock = (struct pxd_lock *) maplock;
2566 xaddr = addressPXD(&pxdlock->pxd);
2567 xlen = lengthPXD(&pxdlock->pxd);
2568 dbFree(ip, xaddr, (s64) xlen);
2569 jfs_info("freeWMap: xaddr:0x%lx xlen:%d",
2570 (ulong) xaddr, xlen);
2571 } else { /* (maplock->flag & mlckFREEPXDLIST) */
2573 pxdlistlock = (struct xdlistlock *) maplock;
2574 pxd = pxdlistlock->xdlist;
2575 for (n = 0; n < pxdlistlock->count; n++, pxd++) {
2576 xaddr = addressPXD(pxd);
2577 xlen = lengthPXD(pxd);
2578 dbFree(ip, xaddr, (s64) xlen);
2579 jfs_info("freeWMap: xaddr:0x%lx xlen:%d",
2580 (ulong) xaddr, xlen);
2587 * txFreelock()
2589 * function: remove tlock from inode anonymous locklist
2591 void txFreelock(struct inode *ip)
2593 struct jfs_inode_info *jfs_ip = JFS_IP(ip);
2594 struct tlock *xtlck, *tlck;
2595 lid_t xlid = 0, lid;
2597 if (!jfs_ip->atlhead)
2598 return;
2600 TXN_LOCK();
2601 xtlck = (struct tlock *) &jfs_ip->atlhead;
2603 while ((lid = xtlck->next) != 0) {
2604 tlck = lid_to_tlock(lid);
2605 if (tlck->flag & tlckFREELOCK) {
2606 xtlck->next = tlck->next;
2607 txLockFree(lid);
2608 } else {
2609 xtlck = tlck;
2610 xlid = lid;
2614 if (jfs_ip->atlhead)
2615 jfs_ip->atltail = xlid;
2616 else {
2617 jfs_ip->atltail = 0;
2619 * If inode was on anon_list, remove it
2621 list_del_init(&jfs_ip->anon_inode_list);
2623 TXN_UNLOCK();
2627 * txAbort()
2629 * function: abort tx before commit;
2631 * frees line-locks and segment locks for all
2632 * segments in comdata structure.
2633 * Optionally sets state of file-system to FM_DIRTY in super-block.
2634 * log age of page-frames in memory for which caller has
2635 * are reset to 0 (to avoid logwarap).
2637 void txAbort(tid_t tid, int dirty)
2639 lid_t lid, next;
2640 struct metapage *mp;
2641 struct tblock *tblk = tid_to_tblock(tid);
2642 struct tlock *tlck;
2645 * free tlocks of the transaction
2647 for (lid = tblk->next; lid; lid = next) {
2648 tlck = lid_to_tlock(lid);
2649 next = tlck->next;
2650 mp = tlck->mp;
2651 JFS_IP(tlck->ip)->xtlid = 0;
2653 if (mp) {
2654 mp->lid = 0;
2657 * reset lsn of page to avoid logwarap:
2659 * (page may have been previously committed by another
2660 * transaction(s) but has not been paged, i.e.,
2661 * it may be on logsync list even though it has not
2662 * been logged for the current tx.)
2664 if (mp->xflag & COMMIT_PAGE && mp->lsn)
2665 LogSyncRelease(mp);
2667 /* insert tlock at head of freelist */
2668 TXN_LOCK();
2669 txLockFree(lid);
2670 TXN_UNLOCK();
2673 /* caller will free the transaction block */
2675 tblk->next = tblk->last = 0;
2678 * mark filesystem dirty
2680 if (dirty)
2681 jfs_error(tblk->sb, "txAbort");
2683 return;
2687 * txLazyCommit(void)
2689 * All transactions except those changing ipimap (COMMIT_FORCE) are
2690 * processed by this routine. This insures that the inode and block
2691 * allocation maps are updated in order. For synchronous transactions,
2692 * let the user thread finish processing after txUpdateMap() is called.
2694 static void txLazyCommit(struct tblock * tblk)
2696 struct jfs_log *log;
2698 while (((tblk->flag & tblkGC_READY) == 0) &&
2699 ((tblk->flag & tblkGC_UNLOCKED) == 0)) {
2700 /* We must have gotten ahead of the user thread
2702 jfs_info("jfs_lazycommit: tblk 0x%p not unlocked", tblk);
2703 yield();
2706 jfs_info("txLazyCommit: processing tblk 0x%p", tblk);
2708 txUpdateMap(tblk);
2710 log = (struct jfs_log *) JFS_SBI(tblk->sb)->log;
2712 spin_lock_irq(&log->gclock); // LOGGC_LOCK
2714 tblk->flag |= tblkGC_COMMITTED;
2716 if (tblk->flag & tblkGC_READY)
2717 log->gcrtc--;
2719 wake_up_all(&tblk->gcwait); // LOGGC_WAKEUP
2722 * Can't release log->gclock until we've tested tblk->flag
2724 if (tblk->flag & tblkGC_LAZY) {
2725 spin_unlock_irq(&log->gclock); // LOGGC_UNLOCK
2726 txUnlock(tblk);
2727 tblk->flag &= ~tblkGC_LAZY;
2728 txEnd(tblk - TxBlock); /* Convert back to tid */
2729 } else
2730 spin_unlock_irq(&log->gclock); // LOGGC_UNLOCK
2732 jfs_info("txLazyCommit: done: tblk = 0x%p", tblk);
2736 * jfs_lazycommit(void)
2738 * To be run as a kernel daemon. If lbmIODone is called in an interrupt
2739 * context, or where blocking is not wanted, this routine will process
2740 * committed transactions from the unlock queue.
2742 int jfs_lazycommit(void *arg)
2744 int WorkDone;
2745 struct tblock *tblk;
2746 unsigned long flags;
2747 struct jfs_sb_info *sbi;
2749 do {
2750 LAZY_LOCK(flags);
2751 jfs_commit_thread_waking = 0; /* OK to wake another thread */
2752 while (!list_empty(&TxAnchor.unlock_queue)) {
2753 WorkDone = 0;
2754 list_for_each_entry(tblk, &TxAnchor.unlock_queue,
2755 cqueue) {
2757 sbi = JFS_SBI(tblk->sb);
2759 * For each volume, the transactions must be
2760 * handled in order. If another commit thread
2761 * is handling a tblk for this superblock,
2762 * skip it
2764 if (sbi->commit_state & IN_LAZYCOMMIT)
2765 continue;
2767 sbi->commit_state |= IN_LAZYCOMMIT;
2768 WorkDone = 1;
2771 * Remove transaction from queue
2773 list_del(&tblk->cqueue);
2775 LAZY_UNLOCK(flags);
2776 txLazyCommit(tblk);
2777 LAZY_LOCK(flags);
2779 sbi->commit_state &= ~IN_LAZYCOMMIT;
2781 * Don't continue in the for loop. (We can't
2782 * anyway, it's unsafe!) We want to go back to
2783 * the beginning of the list.
2785 break;
2788 /* If there was nothing to do, don't continue */
2789 if (!WorkDone)
2790 break;
2792 /* In case a wakeup came while all threads were active */
2793 jfs_commit_thread_waking = 0;
2795 if (freezing(current)) {
2796 LAZY_UNLOCK(flags);
2797 refrigerator();
2798 } else {
2799 DECLARE_WAITQUEUE(wq, current);
2801 add_wait_queue(&jfs_commit_thread_wait, &wq);
2802 set_current_state(TASK_INTERRUPTIBLE);
2803 LAZY_UNLOCK(flags);
2804 schedule();
2805 __set_current_state(TASK_RUNNING);
2806 remove_wait_queue(&jfs_commit_thread_wait, &wq);
2808 } while (!kthread_should_stop());
2810 if (!list_empty(&TxAnchor.unlock_queue))
2811 jfs_err("jfs_lazycommit being killed w/pending transactions!");
2812 else
2813 jfs_info("jfs_lazycommit being killed\n");
2814 return 0;
2817 void txLazyUnlock(struct tblock * tblk)
2819 unsigned long flags;
2821 LAZY_LOCK(flags);
2823 list_add_tail(&tblk->cqueue, &TxAnchor.unlock_queue);
2825 * Don't wake up a commit thread if there is already one servicing
2826 * this superblock, or if the last one we woke up hasn't started yet.
2828 if (!(JFS_SBI(tblk->sb)->commit_state & IN_LAZYCOMMIT) &&
2829 !jfs_commit_thread_waking) {
2830 jfs_commit_thread_waking = 1;
2831 wake_up(&jfs_commit_thread_wait);
2833 LAZY_UNLOCK(flags);
2836 static void LogSyncRelease(struct metapage * mp)
2838 struct jfs_log *log = mp->log;
2840 assert(mp->nohomeok);
2841 assert(log);
2842 metapage_homeok(mp);
2846 * txQuiesce
2848 * Block all new transactions and push anonymous transactions to
2849 * completion
2851 * This does almost the same thing as jfs_sync below. We don't
2852 * worry about deadlocking when jfs_tlocks_low is set, since we would
2853 * expect jfs_sync to get us out of that jam.
2855 void txQuiesce(struct super_block *sb)
2857 struct inode *ip;
2858 struct jfs_inode_info *jfs_ip;
2859 struct jfs_log *log = JFS_SBI(sb)->log;
2860 tid_t tid;
2862 set_bit(log_QUIESCE, &log->flag);
2864 TXN_LOCK();
2865 restart:
2866 while (!list_empty(&TxAnchor.anon_list)) {
2867 jfs_ip = list_entry(TxAnchor.anon_list.next,
2868 struct jfs_inode_info,
2869 anon_inode_list);
2870 ip = &jfs_ip->vfs_inode;
2873 * inode will be removed from anonymous list
2874 * when it is committed
2876 TXN_UNLOCK();
2877 tid = txBegin(ip->i_sb, COMMIT_INODE | COMMIT_FORCE);
2878 mutex_lock(&jfs_ip->commit_mutex);
2879 txCommit(tid, 1, &ip, 0);
2880 txEnd(tid);
2881 mutex_unlock(&jfs_ip->commit_mutex);
2883 * Just to be safe. I don't know how
2884 * long we can run without blocking
2886 cond_resched();
2887 TXN_LOCK();
2891 * If jfs_sync is running in parallel, there could be some inodes
2892 * on anon_list2. Let's check.
2894 if (!list_empty(&TxAnchor.anon_list2)) {
2895 list_splice(&TxAnchor.anon_list2, &TxAnchor.anon_list);
2896 INIT_LIST_HEAD(&TxAnchor.anon_list2);
2897 goto restart;
2899 TXN_UNLOCK();
2902 * We may need to kick off the group commit
2904 jfs_flush_journal(log, 0);
2908 * txResume()
2910 * Allows transactions to start again following txQuiesce
2912 void txResume(struct super_block *sb)
2914 struct jfs_log *log = JFS_SBI(sb)->log;
2916 clear_bit(log_QUIESCE, &log->flag);
2917 TXN_WAKEUP(&log->syncwait);
2921 * jfs_sync(void)
2923 * To be run as a kernel daemon. This is awakened when tlocks run low.
2924 * We write any inodes that have anonymous tlocks so they will become
2925 * available.
2927 int jfs_sync(void *arg)
2929 struct inode *ip;
2930 struct jfs_inode_info *jfs_ip;
2931 int rc;
2932 tid_t tid;
2934 do {
2936 * write each inode on the anonymous inode list
2938 TXN_LOCK();
2939 while (jfs_tlocks_low && !list_empty(&TxAnchor.anon_list)) {
2940 jfs_ip = list_entry(TxAnchor.anon_list.next,
2941 struct jfs_inode_info,
2942 anon_inode_list);
2943 ip = &jfs_ip->vfs_inode;
2945 if (! igrab(ip)) {
2947 * Inode is being freed
2949 list_del_init(&jfs_ip->anon_inode_list);
2950 } else if (mutex_trylock(&jfs_ip->commit_mutex)) {
2952 * inode will be removed from anonymous list
2953 * when it is committed
2955 TXN_UNLOCK();
2956 tid = txBegin(ip->i_sb, COMMIT_INODE);
2957 rc = txCommit(tid, 1, &ip, 0);
2958 txEnd(tid);
2959 mutex_unlock(&jfs_ip->commit_mutex);
2961 iput(ip);
2963 * Just to be safe. I don't know how
2964 * long we can run without blocking
2966 cond_resched();
2967 TXN_LOCK();
2968 } else {
2969 /* We can't get the commit mutex. It may
2970 * be held by a thread waiting for tlock's
2971 * so let's not block here. Save it to
2972 * put back on the anon_list.
2975 /* Take off anon_list */
2976 list_del(&jfs_ip->anon_inode_list);
2978 /* Put on anon_list2 */
2979 list_add(&jfs_ip->anon_inode_list,
2980 &TxAnchor.anon_list2);
2982 TXN_UNLOCK();
2983 iput(ip);
2984 TXN_LOCK();
2987 /* Add anon_list2 back to anon_list */
2988 list_splice_init(&TxAnchor.anon_list2, &TxAnchor.anon_list);
2990 if (freezing(current)) {
2991 TXN_UNLOCK();
2992 refrigerator();
2993 } else {
2994 set_current_state(TASK_INTERRUPTIBLE);
2995 TXN_UNLOCK();
2996 schedule();
2997 __set_current_state(TASK_RUNNING);
2999 } while (!kthread_should_stop());
3001 jfs_info("jfs_sync being killed");
3002 return 0;
3005 #if defined(CONFIG_PROC_FS) && defined(CONFIG_JFS_DEBUG)
3006 int jfs_txanchor_read(char *buffer, char **start, off_t offset, int length,
3007 int *eof, void *data)
3009 int len = 0;
3010 off_t begin;
3011 char *freewait;
3012 char *freelockwait;
3013 char *lowlockwait;
3015 freewait =
3016 waitqueue_active(&TxAnchor.freewait) ? "active" : "empty";
3017 freelockwait =
3018 waitqueue_active(&TxAnchor.freelockwait) ? "active" : "empty";
3019 lowlockwait =
3020 waitqueue_active(&TxAnchor.lowlockwait) ? "active" : "empty";
3022 len += sprintf(buffer,
3023 "JFS TxAnchor\n"
3024 "============\n"
3025 "freetid = %d\n"
3026 "freewait = %s\n"
3027 "freelock = %d\n"
3028 "freelockwait = %s\n"
3029 "lowlockwait = %s\n"
3030 "tlocksInUse = %d\n"
3031 "jfs_tlocks_low = %d\n"
3032 "unlock_queue is %sempty\n",
3033 TxAnchor.freetid,
3034 freewait,
3035 TxAnchor.freelock,
3036 freelockwait,
3037 lowlockwait,
3038 TxAnchor.tlocksInUse,
3039 jfs_tlocks_low,
3040 list_empty(&TxAnchor.unlock_queue) ? "" : "not ");
3042 begin = offset;
3043 *start = buffer + begin;
3044 len -= begin;
3046 if (len > length)
3047 len = length;
3048 else
3049 *eof = 1;
3051 if (len < 0)
3052 len = 0;
3054 return len;
3056 #endif
3058 #if defined(CONFIG_PROC_FS) && defined(CONFIG_JFS_STATISTICS)
3059 int jfs_txstats_read(char *buffer, char **start, off_t offset, int length,
3060 int *eof, void *data)
3062 int len = 0;
3063 off_t begin;
3065 len += sprintf(buffer,
3066 "JFS TxStats\n"
3067 "===========\n"
3068 "calls to txBegin = %d\n"
3069 "txBegin blocked by sync barrier = %d\n"
3070 "txBegin blocked by tlocks low = %d\n"
3071 "txBegin blocked by no free tid = %d\n"
3072 "calls to txBeginAnon = %d\n"
3073 "txBeginAnon blocked by sync barrier = %d\n"
3074 "txBeginAnon blocked by tlocks low = %d\n"
3075 "calls to txLockAlloc = %d\n"
3076 "tLockAlloc blocked by no free lock = %d\n",
3077 TxStat.txBegin,
3078 TxStat.txBegin_barrier,
3079 TxStat.txBegin_lockslow,
3080 TxStat.txBegin_freetid,
3081 TxStat.txBeginAnon,
3082 TxStat.txBeginAnon_barrier,
3083 TxStat.txBeginAnon_lockslow,
3084 TxStat.txLockAlloc,
3085 TxStat.txLockAlloc_freelock);
3087 begin = offset;
3088 *start = buffer + begin;
3089 len -= begin;
3091 if (len > length)
3092 len = length;
3093 else
3094 *eof = 1;
3096 if (len < 0)
3097 len = 0;
3099 return len;
3101 #endif