Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * Copyright (C) International Business Machines Corp., 2000-2005 | |
3 | * Portions Copyright (C) Christoph Hellwig, 2001-2002 | |
4 | * | |
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 | |
63f83c9f | 7 | * the Free Software Foundation; either version 2 of the License, or |
1da177e4 | 8 | * (at your option) any later version. |
63f83c9f | 9 | * |
1da177e4 LT |
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. | |
14 | * | |
15 | * You should have received a copy of the GNU General Public License | |
63f83c9f | 16 | * along with this program; if not, write to the Free Software |
1da177e4 LT |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
18 | */ | |
19 | ||
20 | /* | |
f720e3ba | 21 | * jfs_txnmgr.c: transaction manager |
1da177e4 LT |
22 | * |
23 | * notes: | |
24 | * transaction starts with txBegin() and ends with txCommit() | |
25 | * or txAbort(). | |
26 | * | |
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). | |
31 | * | |
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. | |
36 | * | |
37 | * tlock during write()/mmap() under anonymous transaction (tid = 0): | |
38 | * transferred (?) to transaction at commit time. | |
39 | * | |
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 | |
43 | */ | |
44 | ||
1da177e4 LT |
45 | #include <linux/fs.h> |
46 | #include <linux/vmalloc.h> | |
1da177e4 | 47 | #include <linux/completion.h> |
7dfb7103 | 48 | #include <linux/freezer.h> |
1da177e4 LT |
49 | #include <linux/module.h> |
50 | #include <linux/moduleparam.h> | |
91dbb4de | 51 | #include <linux/kthread.h> |
1da177e4 | 52 | #include "jfs_incore.h" |
1868f4aa | 53 | #include "jfs_inode.h" |
1da177e4 LT |
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" | |
61 | ||
62 | /* | |
f720e3ba | 63 | * transaction management structures |
1da177e4 LT |
64 | */ |
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; | |
79 | ||
80 | int jfs_tlocks_low; /* Indicates low number of available tlocks */ | |
81 | ||
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 | |
95 | ||
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)"); | |
100 | ||
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)"); | |
105 | ||
f720e3ba DK |
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 */ | |
1da177e4 | 111 | |
1da177e4 | 112 | /* |
f720e3ba | 113 | * transaction management lock |
1da177e4 LT |
114 | */ |
115 | static DEFINE_SPINLOCK(jfsTxnLock); | |
116 | ||
f720e3ba DK |
117 | #define TXN_LOCK() spin_lock(&jfsTxnLock) |
118 | #define TXN_UNLOCK() spin_unlock(&jfsTxnLock) | |
1da177e4 LT |
119 | |
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) | |
123 | ||
91dbb4de | 124 | static DECLARE_WAIT_QUEUE_HEAD(jfs_commit_thread_wait); |
1da177e4 LT |
125 | static int jfs_commit_thread_waking; |
126 | ||
127 | /* | |
128 | * Retry logic exist outside these macros to protect from spurrious wakeups. | |
129 | */ | |
130 | static inline void TXN_SLEEP_DROP_LOCK(wait_queue_head_t * event) | |
131 | { | |
132 | DECLARE_WAITQUEUE(wait, current); | |
133 | ||
134 | add_wait_queue(event, &wait); | |
135 | set_current_state(TASK_UNINTERRUPTIBLE); | |
136 | TXN_UNLOCK(); | |
4aa0d230 | 137 | io_schedule(); |
3cbb1c8e | 138 | __set_current_state(TASK_RUNNING); |
1da177e4 LT |
139 | remove_wait_queue(event, &wait); |
140 | } | |
141 | ||
142 | #define TXN_SLEEP(event)\ | |
143 | {\ | |
144 | TXN_SLEEP_DROP_LOCK(event);\ | |
145 | TXN_LOCK();\ | |
146 | } | |
147 | ||
148 | #define TXN_WAKEUP(event) wake_up_all(event) | |
149 | ||
1da177e4 | 150 | /* |
f720e3ba | 151 | * statistics |
1da177e4 LT |
152 | */ |
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; | |
160 | ||
1da177e4 LT |
161 | /* |
162 | * forward references | |
163 | */ | |
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); | |
182 | ||
183 | /* | |
f720e3ba DK |
184 | * transaction block/lock management |
185 | * --------------------------------- | |
1da177e4 LT |
186 | */ |
187 | ||
188 | /* | |
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.) | |
192 | */ | |
193 | static lid_t txLockAlloc(void) | |
194 | { | |
195 | lid_t lid; | |
196 | ||
197 | INCREMENT(TxStat.txLockAlloc); | |
198 | if (!TxAnchor.freelock) { | |
199 | INCREMENT(TxStat.txLockAlloc_freelock); | |
200 | } | |
201 | ||
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; | |
91dbb4de | 209 | wake_up_process(jfsSyncThread); |
1da177e4 LT |
210 | } |
211 | ||
212 | return lid; | |
213 | } | |
214 | ||
215 | static void txLockFree(lid_t lid) | |
216 | { | |
7fab479b | 217 | TxLock[lid].tid = 0; |
1da177e4 LT |
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); | |
225 | } | |
226 | TXN_WAKEUP(&TxAnchor.freelockwait); | |
227 | } | |
228 | ||
229 | /* | |
f720e3ba | 230 | * NAME: txInit() |
1da177e4 | 231 | * |
f720e3ba | 232 | * FUNCTION: initialize transaction management structures |
1da177e4 LT |
233 | * |
234 | * RETURN: | |
235 | * | |
236 | * serialization: single thread at jfs_init() | |
237 | */ | |
238 | int txInit(void) | |
239 | { | |
240 | int k, size; | |
241 | struct sysinfo si; | |
242 | ||
243 | /* Set defaults for nTxLock and nTxBlock if unset */ | |
244 | ||
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; | |
257 | } | |
258 | if (nTxBlock == -1) | |
259 | nTxBlock = nTxLock >> 3; | |
260 | ||
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; | |
270 | ||
271 | printk(KERN_INFO "JFS: nTxBlock = %d, nTxLock = %d\n", | |
272 | nTxBlock, nTxLock); | |
273 | /* | |
274 | * initialize transaction block (tblock) table | |
275 | * | |
276 | * transaction id (tid) = tblock index | |
277 | * tid = 0 is reserved. | |
278 | */ | |
279 | TxLockLWM = (nTxLock * 4) / 10; | |
280 | TxLockHWM = (nTxLock * 7) / 10; | |
281 | TxLockVHWM = (nTxLock * 8) / 10; | |
282 | ||
283 | size = sizeof(struct tblock) * nTxBlock; | |
f52720ca | 284 | TxBlock = vmalloc(size); |
1da177e4 LT |
285 | if (TxBlock == NULL) |
286 | return -ENOMEM; | |
287 | ||
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); | |
292 | } | |
293 | TxBlock[k].next = 0; | |
294 | init_waitqueue_head(&TxBlock[k].gcwait); | |
295 | init_waitqueue_head(&TxBlock[k].waitor); | |
296 | ||
297 | TxAnchor.freetid = 1; | |
298 | init_waitqueue_head(&TxAnchor.freewait); | |
299 | ||
300 | stattx.maxtid = 1; /* statistics */ | |
301 | ||
302 | /* | |
303 | * initialize transaction lock (tlock) table | |
304 | * | |
305 | * transaction lock id = tlock index | |
306 | * tlock id = 0 is reserved. | |
307 | */ | |
308 | size = sizeof(struct tlock) * nTxLock; | |
f52720ca | 309 | TxLock = vmalloc(size); |
1da177e4 LT |
310 | if (TxLock == NULL) { |
311 | vfree(TxBlock); | |
312 | return -ENOMEM; | |
313 | } | |
314 | ||
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); | |
321 | ||
322 | TxAnchor.freelock = 1; | |
323 | TxAnchor.tlocksInUse = 0; | |
324 | INIT_LIST_HEAD(&TxAnchor.anon_list); | |
325 | INIT_LIST_HEAD(&TxAnchor.anon_list2); | |
326 | ||
327 | LAZY_LOCK_INIT(); | |
328 | INIT_LIST_HEAD(&TxAnchor.unlock_queue); | |
329 | ||
330 | stattx.maxlid = 1; /* statistics */ | |
331 | ||
332 | return 0; | |
333 | } | |
334 | ||
335 | /* | |
f720e3ba | 336 | * NAME: txExit() |
1da177e4 | 337 | * |
f720e3ba | 338 | * FUNCTION: clean up when module is unloaded |
1da177e4 LT |
339 | */ |
340 | void txExit(void) | |
341 | { | |
342 | vfree(TxLock); | |
343 | TxLock = NULL; | |
344 | vfree(TxBlock); | |
345 | TxBlock = NULL; | |
346 | } | |
347 | ||
1da177e4 | 348 | /* |
f720e3ba | 349 | * NAME: txBegin() |
1da177e4 | 350 | * |
f720e3ba | 351 | * FUNCTION: start a transaction. |
1da177e4 | 352 | * |
f720e3ba DK |
353 | * PARAMETER: sb - superblock |
354 | * flag - force for nested tx; | |
1da177e4 LT |
355 | * |
356 | * RETURN: tid - transaction id | |
357 | * | |
358 | * note: flag force allows to start tx for nested tx | |
359 | * to prevent deadlock on logsync barrier; | |
360 | */ | |
361 | tid_t txBegin(struct super_block *sb, int flag) | |
362 | { | |
363 | tid_t t; | |
364 | struct tblock *tblk; | |
365 | struct jfs_log *log; | |
366 | ||
367 | jfs_info("txBegin: flag = 0x%x", flag); | |
368 | log = JFS_SBI(sb)->log; | |
369 | ||
370 | TXN_LOCK(); | |
371 | ||
372 | INCREMENT(TxStat.txBegin); | |
373 | ||
374 | retry: | |
375 | if (!(flag & COMMIT_FORCE)) { | |
376 | /* | |
377 | * synchronize with logsync barrier | |
378 | */ | |
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; | |
384 | } | |
385 | } | |
386 | if (flag == 0) { | |
387 | /* | |
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) | |
391 | */ | |
392 | if (TxAnchor.tlocksInUse > TxLockVHWM) { | |
393 | INCREMENT(TxStat.txBegin_lockslow); | |
394 | TXN_SLEEP(&TxAnchor.lowlockwait); | |
395 | goto retry; | |
396 | } | |
397 | } | |
398 | ||
399 | /* | |
400 | * allocate transaction id/block | |
401 | */ | |
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; | |
407 | } | |
408 | ||
409 | tblk = tid_to_tblock(t); | |
410 | ||
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; | |
417 | } | |
418 | ||
419 | TxAnchor.freetid = tblk->next; | |
420 | ||
421 | /* | |
422 | * initialize transaction | |
423 | */ | |
424 | ||
425 | /* | |
426 | * We can't zero the whole thing or we screw up another thread being | |
427 | * awakened after sleeping on tblk->waitor | |
428 | * | |
429 | * memset(tblk, 0, sizeof(struct tblock)); | |
430 | */ | |
431 | tblk->next = tblk->last = tblk->xflag = tblk->flag = tblk->lsn = 0; | |
432 | ||
433 | tblk->sb = sb; | |
434 | ++log->logtid; | |
435 | tblk->logtid = log->logtid; | |
436 | ||
437 | ++log->active; | |
438 | ||
439 | HIGHWATERMARK(stattx.maxtid, t); /* statistics */ | |
440 | INCREMENT(stattx.ntid); /* statistics */ | |
441 | ||
442 | TXN_UNLOCK(); | |
443 | ||
444 | jfs_info("txBegin: returning tid = %d", t); | |
445 | ||
446 | return t; | |
447 | } | |
448 | ||
1da177e4 | 449 | /* |
f720e3ba | 450 | * NAME: txBeginAnon() |
1da177e4 | 451 | * |
f720e3ba | 452 | * FUNCTION: start an anonymous transaction. |
1da177e4 LT |
453 | * Blocks if logsync or available tlocks are low to prevent |
454 | * anonymous tlocks from depleting supply. | |
455 | * | |
f720e3ba | 456 | * PARAMETER: sb - superblock |
1da177e4 LT |
457 | * |
458 | * RETURN: none | |
459 | */ | |
460 | void txBeginAnon(struct super_block *sb) | |
461 | { | |
462 | struct jfs_log *log; | |
463 | ||
464 | log = JFS_SBI(sb)->log; | |
465 | ||
466 | TXN_LOCK(); | |
467 | INCREMENT(TxStat.txBeginAnon); | |
468 | ||
469 | retry: | |
470 | /* | |
471 | * synchronize with logsync barrier | |
472 | */ | |
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; | |
478 | } | |
479 | ||
480 | /* | |
481 | * Don't begin transaction if we're getting starved for tlocks | |
482 | */ | |
483 | if (TxAnchor.tlocksInUse > TxLockVHWM) { | |
484 | INCREMENT(TxStat.txBeginAnon_lockslow); | |
485 | TXN_SLEEP(&TxAnchor.lowlockwait); | |
486 | goto retry; | |
487 | } | |
488 | TXN_UNLOCK(); | |
489 | } | |
490 | ||
1da177e4 | 491 | /* |
f720e3ba | 492 | * txEnd() |
1da177e4 LT |
493 | * |
494 | * function: free specified transaction block. | |
495 | * | |
f720e3ba | 496 | * logsync barrier processing: |
1da177e4 LT |
497 | * |
498 | * serialization: | |
499 | */ | |
500 | void txEnd(tid_t tid) | |
501 | { | |
502 | struct tblock *tblk = tid_to_tblock(tid); | |
503 | struct jfs_log *log; | |
504 | ||
505 | jfs_info("txEnd: tid = %d", tid); | |
506 | TXN_LOCK(); | |
507 | ||
508 | /* | |
509 | * wakeup transactions waiting on the page locked | |
510 | * by the current transaction | |
511 | */ | |
512 | TXN_WAKEUP(&tblk->waitor); | |
513 | ||
514 | log = JFS_SBI(tblk->sb)->log; | |
515 | ||
516 | /* | |
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. | |
520 | * | |
521 | * Lazy commit thread will turn off tblkGC_LAZY before calling this | |
522 | * routine. | |
523 | */ | |
524 | if (tblk->flag & tblkGC_LAZY) { | |
525 | jfs_info("txEnd called w/lazy tid: %d, tblk = 0x%p", tid, tblk); | |
526 | TXN_UNLOCK(); | |
527 | ||
528 | spin_lock_irq(&log->gclock); // LOGGC_LOCK | |
529 | tblk->flag |= tblkGC_UNLOCKED; | |
530 | spin_unlock_irq(&log->gclock); // LOGGC_UNLOCK | |
531 | return; | |
532 | } | |
533 | ||
534 | jfs_info("txEnd: tid: %d, tblk = 0x%p", tid, tblk); | |
535 | ||
536 | assert(tblk->next == 0); | |
537 | ||
538 | /* | |
539 | * insert tblock back on freelist | |
540 | */ | |
541 | tblk->next = TxAnchor.freetid; | |
542 | TxAnchor.freetid = tid; | |
543 | ||
544 | /* | |
545 | * mark the tblock not active | |
546 | */ | |
547 | if (--log->active == 0) { | |
548 | clear_bit(log_FLUSH, &log->flag); | |
549 | ||
550 | /* | |
551 | * synchronize with logsync barrier | |
552 | */ | |
553 | if (test_bit(log_SYNCBARRIER, &log->flag)) { | |
cbc3d65e DK |
554 | TXN_UNLOCK(); |
555 | ||
556 | /* write dirty metadata & forward log syncpt */ | |
557 | jfs_syncpt(log, 1); | |
558 | ||
1da177e4 LT |
559 | jfs_info("log barrier off: 0x%x", log->lsn); |
560 | ||
561 | /* enable new transactions start */ | |
562 | clear_bit(log_SYNCBARRIER, &log->flag); | |
563 | ||
564 | /* wakeup all waitors for logsync barrier */ | |
565 | TXN_WAKEUP(&log->syncwait); | |
1c627829 | 566 | |
1c627829 | 567 | goto wakeup; |
1da177e4 LT |
568 | } |
569 | } | |
570 | ||
1c627829 DK |
571 | TXN_UNLOCK(); |
572 | wakeup: | |
1da177e4 LT |
573 | /* |
574 | * wakeup all waitors for a free tblock | |
575 | */ | |
576 | TXN_WAKEUP(&TxAnchor.freewait); | |
1da177e4 LT |
577 | } |
578 | ||
1da177e4 | 579 | /* |
f720e3ba | 580 | * txLock() |
1da177e4 LT |
581 | * |
582 | * function: acquire a transaction lock on the specified <mp> | |
583 | * | |
584 | * parameter: | |
585 | * | |
f720e3ba | 586 | * return: transaction lock id |
1da177e4 LT |
587 | * |
588 | * serialization: | |
589 | */ | |
590 | struct tlock *txLock(tid_t tid, struct inode *ip, struct metapage * mp, | |
591 | int type) | |
592 | { | |
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; | |
602 | ||
603 | TXN_LOCK(); | |
604 | ||
605 | if (S_ISDIR(ip->i_mode) && (type & tlckXTREE) && | |
606 | !(mp->xflag & COMMIT_PAGE)) { | |
607 | /* | |
608 | * Directory inode is special. It can have both an xtree tlock | |
609 | * and a dtree tlock associated with it. | |
610 | */ | |
611 | dir_xtree = 1; | |
612 | lid = jfs_ip->xtlid; | |
613 | } else | |
614 | lid = mp->lid; | |
615 | ||
616 | /* is page not locked by a transaction ? */ | |
617 | if (lid == 0) | |
618 | goto allocateLock; | |
619 | ||
620 | jfs_info("txLock: tid:%d ip:0x%p mp:0x%p lid:%d", tid, ip, mp, lid); | |
621 | ||
622 | /* is page locked by the requester transaction ? */ | |
623 | tlck = lid_to_tlock(lid); | |
7fab479b DK |
624 | if ((xtid = tlck->tid) == tid) { |
625 | TXN_UNLOCK(); | |
1da177e4 | 626 | goto grantLock; |
7fab479b | 627 | } |
1da177e4 LT |
628 | |
629 | /* | |
630 | * is page locked by anonymous transaction/lock ? | |
631 | * | |
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) | |
639 | */ | |
640 | if (xtid == 0) { | |
641 | tlck->tid = tid; | |
7fab479b | 642 | TXN_UNLOCK(); |
1da177e4 LT |
643 | tblk = tid_to_tblock(tid); |
644 | /* | |
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 | |
650 | * | |
651 | * Note: We really need to get rid of the tid & lid and | |
652 | * use list_head's. This code is getting UGLY! | |
653 | */ | |
654 | if (jfs_ip->atlhead == lid) { | |
655 | if (jfs_ip->atltail == lid) { | |
656 | /* only anonymous txn. | |
657 | * Remove from anon_list | |
658 | */ | |
8a9cd6d6 | 659 | TXN_LOCK(); |
1da177e4 | 660 | list_del_init(&jfs_ip->anon_inode_list); |
8a9cd6d6 | 661 | TXN_UNLOCK(); |
1da177e4 LT |
662 | } |
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); | |
670 | } | |
671 | lid_to_tlock(last)->next = tlck->next; | |
672 | if (jfs_ip->atltail == lid) | |
673 | jfs_ip->atltail = last; | |
674 | } | |
675 | ||
676 | /* insert the tlock at tail of transaction tlock list */ | |
677 | ||
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; | |
684 | ||
685 | goto grantLock; | |
686 | } | |
687 | ||
688 | goto waitLock; | |
689 | ||
690 | /* | |
691 | * allocate a tlock | |
692 | */ | |
693 | allocateLock: | |
694 | lid = txLockAlloc(); | |
695 | tlck = lid_to_tlock(lid); | |
696 | ||
697 | /* | |
698 | * initialize tlock | |
699 | */ | |
700 | tlck->tid = tid; | |
701 | ||
7fab479b DK |
702 | TXN_UNLOCK(); |
703 | ||
1da177e4 LT |
704 | /* mark tlock for meta-data page */ |
705 | if (mp->xflag & COMMIT_PAGE) { | |
706 | ||
707 | tlck->flag = tlckPAGELOCK; | |
708 | ||
709 | /* mark the page dirty and nohomeok */ | |
7fab479b | 710 | metapage_nohomeok(mp); |
1da177e4 LT |
711 | |
712 | jfs_info("locking mp = 0x%p, nohomeok = %d tid = %d tlck = 0x%p", | |
7fab479b | 713 | mp, mp->nohomeok, tid, tlck); |
1da177e4 LT |
714 | |
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. | |
719 | */ | |
720 | if ((tid == 0) && mp->lsn) | |
721 | set_cflag(COMMIT_Synclist, ip); | |
722 | } | |
723 | /* mark tlock for in-memory inode */ | |
724 | else | |
725 | tlck->flag = tlckINODELOCK; | |
726 | ||
438282d8 DK |
727 | if (S_ISDIR(ip->i_mode)) |
728 | tlck->flag |= tlckDIRECTORY; | |
729 | ||
1da177e4 LT |
730 | tlck->type = 0; |
731 | ||
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; | |
739 | ||
740 | /* | |
741 | * enqueue transaction lock to transaction/inode | |
742 | */ | |
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; | |
752 | } | |
753 | /* anonymous transaction: | |
754 | * insert the tlock at head of inode anonymous tlock list | |
755 | */ | |
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; | |
7fab479b | 762 | TXN_LOCK(); |
1da177e4 LT |
763 | list_add_tail(&jfs_ip->anon_inode_list, |
764 | &TxAnchor.anon_list); | |
7fab479b | 765 | TXN_UNLOCK(); |
1da177e4 LT |
766 | } |
767 | } | |
768 | ||
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; | |
775 | ||
776 | switch (type & tlckTYPE) { | |
777 | case tlckDTREE: | |
778 | linelock->l2linesize = L2DTSLOTSIZE; | |
779 | break; | |
780 | ||
781 | case tlckXTREE: | |
782 | linelock->l2linesize = L2XTSLOTSIZE; | |
783 | ||
784 | xtlck = (struct xtlock *) linelock; | |
785 | xtlck->header.offset = 0; | |
786 | xtlck->header.length = 2; | |
787 | ||
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); | |
797 | } | |
798 | xtlck->lwm.length = 0; /* ! */ | |
799 | xtlck->twm.offset = 0; | |
800 | xtlck->hwm.offset = 0; | |
801 | ||
802 | xtlck->index = 2; | |
803 | break; | |
804 | ||
805 | case tlckINODE: | |
806 | linelock->l2linesize = L2INODESLOTSIZE; | |
807 | break; | |
808 | ||
809 | case tlckDATA: | |
810 | linelock->l2linesize = L2DATASLOTSIZE; | |
811 | break; | |
812 | ||
813 | default: | |
814 | jfs_err("UFO tlock:0x%p", tlck); | |
815 | } | |
816 | ||
817 | /* | |
818 | * update tlock vector | |
819 | */ | |
820 | grantLock: | |
821 | tlck->type |= type; | |
822 | ||
1da177e4 LT |
823 | return tlck; |
824 | ||
825 | /* | |
826 | * page is being locked by another transaction: | |
827 | */ | |
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) { | |
209e101b | 832 | printk(KERN_ERR "txLock: trying to lock locked page!"); |
288e4d83 DK |
833 | print_hex_dump(KERN_ERR, "ip: ", DUMP_PREFIX_ADDRESS, 16, 4, |
834 | ip, sizeof(*ip), 0); | |
835 | print_hex_dump(KERN_ERR, "mp: ", DUMP_PREFIX_ADDRESS, 16, 4, | |
836 | mp, sizeof(*mp), 0); | |
837 | print_hex_dump(KERN_ERR, "Locker's tblock: ", | |
838 | DUMP_PREFIX_ADDRESS, 16, 4, tid_to_tblock(tid), | |
839 | sizeof(struct tblock), 0); | |
840 | print_hex_dump(KERN_ERR, "Tlock: ", DUMP_PREFIX_ADDRESS, 16, 4, | |
841 | tlck, sizeof(*tlck), 0); | |
1da177e4 LT |
842 | BUG(); |
843 | } | |
844 | INCREMENT(stattx.waitlock); /* statistics */ | |
7fab479b | 845 | TXN_UNLOCK(); |
1da177e4 | 846 | release_metapage(mp); |
7fab479b | 847 | TXN_LOCK(); |
0418726b | 848 | xtid = tlck->tid; /* reacquire after dropping TXN_LOCK */ |
1da177e4 LT |
849 | |
850 | jfs_info("txLock: in waitLock, tid = %d, xtid = %d, lid = %d", | |
851 | tid, xtid, lid); | |
7fab479b DK |
852 | |
853 | /* Recheck everything since dropping TXN_LOCK */ | |
854 | if (xtid && (tlck->mp == mp) && (mp->lid == lid)) | |
855 | TXN_SLEEP_DROP_LOCK(&tid_to_tblock(xtid)->waitor); | |
856 | else | |
857 | TXN_UNLOCK(); | |
1da177e4 LT |
858 | jfs_info("txLock: awakened tid = %d, lid = %d", tid, lid); |
859 | ||
860 | return NULL; | |
861 | } | |
862 | ||
1da177e4 | 863 | /* |
f720e3ba | 864 | * NAME: txRelease() |
1da177e4 | 865 | * |
f720e3ba | 866 | * FUNCTION: Release buffers associated with transaction locks, but don't |
1da177e4 LT |
867 | * mark homeok yet. The allows other transactions to modify |
868 | * buffers, but won't let them go to disk until commit record | |
869 | * actually gets written. | |
870 | * | |
871 | * PARAMETER: | |
f720e3ba | 872 | * tblk - |
1da177e4 | 873 | * |
f720e3ba | 874 | * RETURN: Errors from subroutines. |
1da177e4 LT |
875 | */ |
876 | static void txRelease(struct tblock * tblk) | |
877 | { | |
878 | struct metapage *mp; | |
879 | lid_t lid; | |
880 | struct tlock *tlck; | |
881 | ||
882 | TXN_LOCK(); | |
883 | ||
884 | for (lid = tblk->next; lid; lid = tlck->next) { | |
885 | tlck = lid_to_tlock(lid); | |
886 | if ((mp = tlck->mp) != NULL && | |
887 | (tlck->type & tlckBTROOT) == 0) { | |
888 | assert(mp->xflag & COMMIT_PAGE); | |
889 | mp->lid = 0; | |
890 | } | |
891 | } | |
892 | ||
893 | /* | |
894 | * wakeup transactions waiting on a page locked | |
895 | * by the current transaction | |
896 | */ | |
897 | TXN_WAKEUP(&tblk->waitor); | |
898 | ||
899 | TXN_UNLOCK(); | |
900 | } | |
901 | ||
1da177e4 | 902 | /* |
f720e3ba | 903 | * NAME: txUnlock() |
1da177e4 | 904 | * |
f720e3ba DK |
905 | * FUNCTION: Initiates pageout of pages modified by tid in journalled |
906 | * objects and frees their lockwords. | |
1da177e4 LT |
907 | */ |
908 | static void txUnlock(struct tblock * tblk) | |
909 | { | |
910 | struct tlock *tlck; | |
911 | struct linelock *linelock; | |
912 | lid_t lid, next, llid, k; | |
913 | struct metapage *mp; | |
914 | struct jfs_log *log; | |
915 | int difft, diffp; | |
7fab479b | 916 | unsigned long flags; |
1da177e4 LT |
917 | |
918 | jfs_info("txUnlock: tblk = 0x%p", tblk); | |
919 | log = JFS_SBI(tblk->sb)->log; | |
920 | ||
921 | /* | |
922 | * mark page under tlock homeok (its log has been written): | |
923 | */ | |
924 | for (lid = tblk->next; lid; lid = next) { | |
925 | tlck = lid_to_tlock(lid); | |
926 | next = tlck->next; | |
927 | ||
928 | jfs_info("unlocking lid = %d, tlck = 0x%p", lid, tlck); | |
929 | ||
930 | /* unbind page from tlock */ | |
931 | if ((mp = tlck->mp) != NULL && | |
932 | (tlck->type & tlckBTROOT) == 0) { | |
933 | assert(mp->xflag & COMMIT_PAGE); | |
934 | ||
935 | /* hold buffer | |
1da177e4 | 936 | */ |
7fab479b | 937 | hold_metapage(mp); |
1da177e4 | 938 | |
7fab479b DK |
939 | assert(mp->nohomeok > 0); |
940 | _metapage_homeok(mp); | |
1da177e4 LT |
941 | |
942 | /* inherit younger/larger clsn */ | |
7fab479b | 943 | LOGSYNC_LOCK(log, flags); |
1da177e4 LT |
944 | if (mp->clsn) { |
945 | logdiff(difft, tblk->clsn, log); | |
946 | logdiff(diffp, mp->clsn, log); | |
947 | if (difft > diffp) | |
948 | mp->clsn = tblk->clsn; | |
949 | } else | |
950 | mp->clsn = tblk->clsn; | |
7fab479b | 951 | LOGSYNC_UNLOCK(log, flags); |
1da177e4 LT |
952 | |
953 | assert(!(tlck->flag & tlckFREEPAGE)); | |
954 | ||
7fab479b | 955 | put_metapage(mp); |
1da177e4 LT |
956 | } |
957 | ||
958 | /* insert tlock, and linelock(s) of the tlock if any, | |
959 | * at head of freelist | |
960 | */ | |
961 | TXN_LOCK(); | |
962 | ||
963 | llid = ((struct linelock *) & tlck->lock)->next; | |
964 | while (llid) { | |
965 | linelock = (struct linelock *) lid_to_tlock(llid); | |
966 | k = linelock->next; | |
967 | txLockFree(llid); | |
968 | llid = k; | |
969 | } | |
970 | txLockFree(lid); | |
971 | ||
972 | TXN_UNLOCK(); | |
973 | } | |
974 | tblk->next = tblk->last = 0; | |
975 | ||
976 | /* | |
977 | * remove tblock from logsynclist | |
978 | * (allocation map pages inherited lsn of tblk and | |
979 | * has been inserted in logsync list at txUpdateMap()) | |
980 | */ | |
981 | if (tblk->lsn) { | |
7fab479b | 982 | LOGSYNC_LOCK(log, flags); |
1da177e4 LT |
983 | log->count--; |
984 | list_del(&tblk->synclist); | |
7fab479b | 985 | LOGSYNC_UNLOCK(log, flags); |
1da177e4 LT |
986 | } |
987 | } | |
988 | ||
1da177e4 | 989 | /* |
f720e3ba | 990 | * txMaplock() |
1da177e4 LT |
991 | * |
992 | * function: allocate a transaction lock for freed page/entry; | |
f720e3ba | 993 | * for freed page, maplock is used as xtlock/dtlock type; |
1da177e4 LT |
994 | */ |
995 | struct tlock *txMaplock(tid_t tid, struct inode *ip, int type) | |
996 | { | |
997 | struct jfs_inode_info *jfs_ip = JFS_IP(ip); | |
998 | lid_t lid; | |
999 | struct tblock *tblk; | |
1000 | struct tlock *tlck; | |
1001 | struct maplock *maplock; | |
1002 | ||
1003 | TXN_LOCK(); | |
1004 | ||
1005 | /* | |
1006 | * allocate a tlock | |
1007 | */ | |
1008 | lid = txLockAlloc(); | |
1009 | tlck = lid_to_tlock(lid); | |
1010 | ||
1011 | /* | |
1012 | * initialize tlock | |
1013 | */ | |
1014 | tlck->tid = tid; | |
1015 | ||
1016 | /* bind the tlock and the object */ | |
1017 | tlck->flag = tlckINODELOCK; | |
438282d8 DK |
1018 | if (S_ISDIR(ip->i_mode)) |
1019 | tlck->flag |= tlckDIRECTORY; | |
1da177e4 LT |
1020 | tlck->ip = ip; |
1021 | tlck->mp = NULL; | |
1022 | ||
1023 | tlck->type = type; | |
1024 | ||
1025 | /* | |
1026 | * enqueue transaction lock to transaction/inode | |
1027 | */ | |
1028 | /* insert the tlock at tail of transaction tlock list */ | |
1029 | if (tid) { | |
1030 | tblk = tid_to_tblock(tid); | |
1031 | if (tblk->next) | |
1032 | lid_to_tlock(tblk->last)->next = lid; | |
1033 | else | |
1034 | tblk->next = lid; | |
1035 | tlck->next = 0; | |
1036 | tblk->last = lid; | |
1037 | } | |
1038 | /* anonymous transaction: | |
1039 | * insert the tlock at head of inode anonymous tlock list | |
1040 | */ | |
1041 | else { | |
1042 | tlck->next = jfs_ip->atlhead; | |
1043 | jfs_ip->atlhead = lid; | |
1044 | if (tlck->next == 0) { | |
1045 | /* This inode's first anonymous transaction */ | |
1046 | jfs_ip->atltail = lid; | |
1047 | list_add_tail(&jfs_ip->anon_inode_list, | |
1048 | &TxAnchor.anon_list); | |
1049 | } | |
1050 | } | |
1051 | ||
1052 | TXN_UNLOCK(); | |
1053 | ||
1054 | /* initialize type dependent area for maplock */ | |
1055 | maplock = (struct maplock *) & tlck->lock; | |
1056 | maplock->next = 0; | |
1057 | maplock->maxcnt = 0; | |
1058 | maplock->index = 0; | |
1059 | ||
1060 | return tlck; | |
1061 | } | |
1062 | ||
1da177e4 | 1063 | /* |
f720e3ba | 1064 | * txLinelock() |
1da177e4 LT |
1065 | * |
1066 | * function: allocate a transaction lock for log vector list | |
1067 | */ | |
1068 | struct linelock *txLinelock(struct linelock * tlock) | |
1069 | { | |
1070 | lid_t lid; | |
1071 | struct tlock *tlck; | |
1072 | struct linelock *linelock; | |
1073 | ||
1074 | TXN_LOCK(); | |
1075 | ||
1076 | /* allocate a TxLock structure */ | |
1077 | lid = txLockAlloc(); | |
1078 | tlck = lid_to_tlock(lid); | |
1079 | ||
1080 | TXN_UNLOCK(); | |
1081 | ||
1082 | /* initialize linelock */ | |
1083 | linelock = (struct linelock *) tlck; | |
1084 | linelock->next = 0; | |
1085 | linelock->flag = tlckLINELOCK; | |
1086 | linelock->maxcnt = TLOCKLONG; | |
1087 | linelock->index = 0; | |
438282d8 DK |
1088 | if (tlck->flag & tlckDIRECTORY) |
1089 | linelock->flag |= tlckDIRECTORY; | |
1da177e4 LT |
1090 | |
1091 | /* append linelock after tlock */ | |
1092 | linelock->next = tlock->next; | |
1093 | tlock->next = lid; | |
1094 | ||
1095 | return linelock; | |
1096 | } | |
1097 | ||
1da177e4 | 1098 | /* |
f720e3ba DK |
1099 | * transaction commit management |
1100 | * ----------------------------- | |
1da177e4 LT |
1101 | */ |
1102 | ||
1103 | /* | |
f720e3ba DK |
1104 | * NAME: txCommit() |
1105 | * | |
1106 | * FUNCTION: commit the changes to the objects specified in | |
1107 | * clist. For journalled segments only the | |
1108 | * changes of the caller are committed, ie by tid. | |
1109 | * for non-journalled segments the data are flushed to | |
1110 | * disk and then the change to the disk inode and indirect | |
1111 | * blocks committed (so blocks newly allocated to the | |
1112 | * segment will be made a part of the segment atomically). | |
1113 | * | |
1114 | * all of the segments specified in clist must be in | |
1115 | * one file system. no more than 6 segments are needed | |
1116 | * to handle all unix svcs. | |
1117 | * | |
1118 | * if the i_nlink field (i.e. disk inode link count) | |
1119 | * is zero, and the type of inode is a regular file or | |
1120 | * directory, or symbolic link , the inode is truncated | |
1121 | * to zero length. the truncation is committed but the | |
1122 | * VM resources are unaffected until it is closed (see | |
1123 | * iput and iclose). | |
1da177e4 LT |
1124 | * |
1125 | * PARAMETER: | |
1126 | * | |
1127 | * RETURN: | |
1128 | * | |
1129 | * serialization: | |
f720e3ba DK |
1130 | * on entry the inode lock on each segment is assumed |
1131 | * to be held. | |
1da177e4 LT |
1132 | * |
1133 | * i/o error: | |
1134 | */ | |
1135 | int txCommit(tid_t tid, /* transaction identifier */ | |
1136 | int nip, /* number of inodes to commit */ | |
1137 | struct inode **iplist, /* list of inode to commit */ | |
1138 | int flag) | |
1139 | { | |
1140 | int rc = 0; | |
1141 | struct commit cd; | |
1142 | struct jfs_log *log; | |
1143 | struct tblock *tblk; | |
1144 | struct lrd *lrd; | |
1145 | int lsn; | |
1146 | struct inode *ip; | |
1147 | struct jfs_inode_info *jfs_ip; | |
1148 | int k, n; | |
1149 | ino_t top; | |
1150 | struct super_block *sb; | |
1151 | ||
1152 | jfs_info("txCommit, tid = %d, flag = %d", tid, flag); | |
1153 | /* is read-only file system ? */ | |
1154 | if (isReadOnly(iplist[0])) { | |
1155 | rc = -EROFS; | |
1156 | goto TheEnd; | |
1157 | } | |
1158 | ||
1159 | sb = cd.sb = iplist[0]->i_sb; | |
1160 | cd.tid = tid; | |
1161 | ||
1162 | if (tid == 0) | |
1163 | tid = txBegin(sb, 0); | |
1164 | tblk = tid_to_tblock(tid); | |
1165 | ||
1166 | /* | |
1167 | * initialize commit structure | |
1168 | */ | |
1169 | log = JFS_SBI(sb)->log; | |
1170 | cd.log = log; | |
1171 | ||
1172 | /* initialize log record descriptor in commit */ | |
1173 | lrd = &cd.lrd; | |
1174 | lrd->logtid = cpu_to_le32(tblk->logtid); | |
1175 | lrd->backchain = 0; | |
1176 | ||
1177 | tblk->xflag |= flag; | |
1178 | ||
1179 | if ((flag & (COMMIT_FORCE | COMMIT_SYNC)) == 0) | |
1180 | tblk->xflag |= COMMIT_LAZY; | |
1181 | /* | |
f720e3ba | 1182 | * prepare non-journaled objects for commit |
1da177e4 LT |
1183 | * |
1184 | * flush data pages of non-journaled file | |
1185 | * to prevent the file getting non-initialized disk blocks | |
1186 | * in case of crash. | |
1187 | * (new blocks - ) | |
1188 | */ | |
1189 | cd.iplist = iplist; | |
1190 | cd.nip = nip; | |
1191 | ||
1192 | /* | |
f720e3ba | 1193 | * acquire transaction lock on (on-disk) inodes |
1da177e4 LT |
1194 | * |
1195 | * update on-disk inode from in-memory inode | |
1196 | * acquiring transaction locks for AFTER records | |
1197 | * on the on-disk inode of file object | |
1198 | * | |
1199 | * sort the inodes array by inode number in descending order | |
1200 | * to prevent deadlock when acquiring transaction lock | |
1201 | * of on-disk inodes on multiple on-disk inode pages by | |
1202 | * multiple concurrent transactions | |
1203 | */ | |
1204 | for (k = 0; k < cd.nip; k++) { | |
1205 | top = (cd.iplist[k])->i_ino; | |
1206 | for (n = k + 1; n < cd.nip; n++) { | |
1207 | ip = cd.iplist[n]; | |
1208 | if (ip->i_ino > top) { | |
1209 | top = ip->i_ino; | |
1210 | cd.iplist[n] = cd.iplist[k]; | |
1211 | cd.iplist[k] = ip; | |
1212 | } | |
1213 | } | |
1214 | ||
1215 | ip = cd.iplist[k]; | |
1216 | jfs_ip = JFS_IP(ip); | |
1217 | ||
1218 | /* | |
1219 | * BUGBUG - This code has temporarily been removed. The | |
1220 | * intent is to ensure that any file data is written before | |
1221 | * the metadata is committed to the journal. This prevents | |
1222 | * uninitialized data from appearing in a file after the | |
1223 | * journal has been replayed. (The uninitialized data | |
1224 | * could be sensitive data removed by another user.) | |
1225 | * | |
1226 | * The problem now is that we are holding the IWRITELOCK | |
1227 | * on the inode, and calling filemap_fdatawrite on an | |
1228 | * unmapped page will cause a deadlock in jfs_get_block. | |
1229 | * | |
1230 | * The long term solution is to pare down the use of | |
1231 | * IWRITELOCK. We are currently holding it too long. | |
1232 | * We could also be smarter about which data pages need | |
1233 | * to be written before the transaction is committed and | |
1234 | * when we don't need to worry about it at all. | |
1235 | * | |
1236 | * if ((!S_ISDIR(ip->i_mode)) | |
28fd1298 OH |
1237 | * && (tblk->flag & COMMIT_DELETE) == 0) |
1238 | * filemap_write_and_wait(ip->i_mapping); | |
1da177e4 LT |
1239 | */ |
1240 | ||
1241 | /* | |
1242 | * Mark inode as not dirty. It will still be on the dirty | |
1243 | * inode list, but we'll know not to commit it again unless | |
1244 | * it gets marked dirty again | |
1245 | */ | |
1246 | clear_cflag(COMMIT_Dirty, ip); | |
1247 | ||
1248 | /* inherit anonymous tlock(s) of inode */ | |
1249 | if (jfs_ip->atlhead) { | |
1250 | lid_to_tlock(jfs_ip->atltail)->next = tblk->next; | |
1251 | tblk->next = jfs_ip->atlhead; | |
1252 | if (!tblk->last) | |
1253 | tblk->last = jfs_ip->atltail; | |
1254 | jfs_ip->atlhead = jfs_ip->atltail = 0; | |
1255 | TXN_LOCK(); | |
1256 | list_del_init(&jfs_ip->anon_inode_list); | |
1257 | TXN_UNLOCK(); | |
1258 | } | |
1259 | ||
1260 | /* | |
1261 | * acquire transaction lock on on-disk inode page | |
1262 | * (become first tlock of the tblk's tlock list) | |
1263 | */ | |
1264 | if (((rc = diWrite(tid, ip)))) | |
1265 | goto out; | |
1266 | } | |
1267 | ||
1268 | /* | |
f720e3ba | 1269 | * write log records from transaction locks |
1da177e4 LT |
1270 | * |
1271 | * txUpdateMap() resets XAD_NEW in XAD. | |
1272 | */ | |
1273 | if ((rc = txLog(log, tblk, &cd))) | |
1274 | goto TheEnd; | |
1275 | ||
1276 | /* | |
1277 | * Ensure that inode isn't reused before | |
1278 | * lazy commit thread finishes processing | |
1279 | */ | |
1280 | if (tblk->xflag & COMMIT_DELETE) { | |
1281 | atomic_inc(&tblk->u.ip->i_count); | |
1282 | /* | |
1283 | * Avoid a rare deadlock | |
1284 | * | |
1285 | * If the inode is locked, we may be blocked in | |
1286 | * jfs_commit_inode. If so, we don't want the | |
1287 | * lazy_commit thread doing the last iput() on the inode | |
1288 | * since that may block on the locked inode. Instead, | |
1289 | * commit the transaction synchronously, so the last iput | |
1290 | * will be done by the calling thread (or later) | |
1291 | */ | |
1c0eeaf5 JE |
1292 | /* |
1293 | * I believe this code is no longer needed. Splitting I_LOCK | |
1294 | * into two bits, I_LOCK and I_SYNC should prevent this | |
1295 | * deadlock as well. But since I don't have a JFS testload | |
1296 | * to verify this, only a trivial s/I_LOCK/I_SYNC/ was done. | |
1297 | * Joern | |
1298 | */ | |
1299 | if (tblk->u.ip->i_state & I_SYNC) | |
1da177e4 LT |
1300 | tblk->xflag &= ~COMMIT_LAZY; |
1301 | } | |
1302 | ||
1303 | ASSERT((!(tblk->xflag & COMMIT_DELETE)) || | |
1304 | ((tblk->u.ip->i_nlink == 0) && | |
1305 | !test_cflag(COMMIT_Nolink, tblk->u.ip))); | |
1306 | ||
1307 | /* | |
f720e3ba | 1308 | * write COMMIT log record |
1da177e4 LT |
1309 | */ |
1310 | lrd->type = cpu_to_le16(LOG_COMMIT); | |
1311 | lrd->length = 0; | |
1312 | lsn = lmLog(log, tblk, lrd, NULL); | |
1313 | ||
1314 | lmGroupCommit(log, tblk); | |
1315 | ||
1316 | /* | |
f720e3ba | 1317 | * - transaction is now committed - |
1da177e4 LT |
1318 | */ |
1319 | ||
1320 | /* | |
1321 | * force pages in careful update | |
1322 | * (imap addressing structure update) | |
1323 | */ | |
1324 | if (flag & COMMIT_FORCE) | |
1325 | txForce(tblk); | |
1326 | ||
1327 | /* | |
f720e3ba | 1328 | * update allocation map. |
1da177e4 LT |
1329 | * |
1330 | * update inode allocation map and inode: | |
1331 | * free pager lock on memory object of inode if any. | |
f720e3ba | 1332 | * update block allocation map. |
1da177e4 LT |
1333 | * |
1334 | * txUpdateMap() resets XAD_NEW in XAD. | |
1335 | */ | |
1336 | if (tblk->xflag & COMMIT_FORCE) | |
1337 | txUpdateMap(tblk); | |
1338 | ||
1339 | /* | |
f720e3ba | 1340 | * free transaction locks and pageout/free pages |
1da177e4 LT |
1341 | */ |
1342 | txRelease(tblk); | |
1343 | ||
1344 | if ((tblk->flag & tblkGC_LAZY) == 0) | |
1345 | txUnlock(tblk); | |
1346 | ||
1347 | ||
1348 | /* | |
f720e3ba | 1349 | * reset in-memory object state |
1da177e4 LT |
1350 | */ |
1351 | for (k = 0; k < cd.nip; k++) { | |
1352 | ip = cd.iplist[k]; | |
1353 | jfs_ip = JFS_IP(ip); | |
1354 | ||
1355 | /* | |
1356 | * reset in-memory inode state | |
1357 | */ | |
1358 | jfs_ip->bxflag = 0; | |
1359 | jfs_ip->blid = 0; | |
1360 | } | |
1361 | ||
1362 | out: | |
1363 | if (rc != 0) | |
1364 | txAbort(tid, 1); | |
1365 | ||
1366 | TheEnd: | |
1367 | jfs_info("txCommit: tid = %d, returning %d", tid, rc); | |
1368 | return rc; | |
1369 | } | |
1370 | ||
1da177e4 | 1371 | /* |
f720e3ba | 1372 | * NAME: txLog() |
1da177e4 | 1373 | * |
f720e3ba DK |
1374 | * FUNCTION: Writes AFTER log records for all lines modified |
1375 | * by tid for segments specified by inodes in comdata. | |
1376 | * Code assumes only WRITELOCKS are recorded in lockwords. | |
1da177e4 LT |
1377 | * |
1378 | * PARAMETERS: | |
1379 | * | |
1380 | * RETURN : | |
1381 | */ | |
1382 | static int txLog(struct jfs_log * log, struct tblock * tblk, struct commit * cd) | |
1383 | { | |
1384 | int rc = 0; | |
1385 | struct inode *ip; | |
1386 | lid_t lid; | |
1387 | struct tlock *tlck; | |
1388 | struct lrd *lrd = &cd->lrd; | |
1389 | ||
1390 | /* | |
1391 | * write log record(s) for each tlock of transaction, | |
1392 | */ | |
1393 | for (lid = tblk->next; lid; lid = tlck->next) { | |
1394 | tlck = lid_to_tlock(lid); | |
1395 | ||
1396 | tlck->flag |= tlckLOG; | |
1397 | ||
1398 | /* initialize lrd common */ | |
1399 | ip = tlck->ip; | |
1400 | lrd->aggregate = cpu_to_le32(JFS_SBI(ip->i_sb)->aggregate); | |
1401 | lrd->log.redopage.fileset = cpu_to_le32(JFS_IP(ip)->fileset); | |
1402 | lrd->log.redopage.inode = cpu_to_le32(ip->i_ino); | |
1403 | ||
1404 | /* write log record of page from the tlock */ | |
1405 | switch (tlck->type & tlckTYPE) { | |
1406 | case tlckXTREE: | |
1407 | xtLog(log, tblk, lrd, tlck); | |
1408 | break; | |
1409 | ||
1410 | case tlckDTREE: | |
1411 | dtLog(log, tblk, lrd, tlck); | |
1412 | break; | |
1413 | ||
1414 | case tlckINODE: | |
1415 | diLog(log, tblk, lrd, tlck, cd); | |
1416 | break; | |
1417 | ||
1418 | case tlckMAP: | |
1419 | mapLog(log, tblk, lrd, tlck); | |
1420 | break; | |
1421 | ||
1422 | case tlckDATA: | |
1423 | dataLog(log, tblk, lrd, tlck); | |
1424 | break; | |
1425 | ||
1426 | default: | |
1427 | jfs_err("UFO tlock:0x%p", tlck); | |
1428 | } | |
1429 | } | |
1430 | ||
1431 | return rc; | |
1432 | } | |
1433 | ||
1da177e4 | 1434 | /* |
f720e3ba | 1435 | * diLog() |
1da177e4 | 1436 | * |
f720e3ba | 1437 | * function: log inode tlock and format maplock to update bmap; |
1da177e4 LT |
1438 | */ |
1439 | static int diLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd, | |
f720e3ba | 1440 | struct tlock * tlck, struct commit * cd) |
1da177e4 LT |
1441 | { |
1442 | int rc = 0; | |
1443 | struct metapage *mp; | |
1444 | pxd_t *pxd; | |
1445 | struct pxd_lock *pxdlock; | |
1446 | ||
1447 | mp = tlck->mp; | |
1448 | ||
1449 | /* initialize as REDOPAGE record format */ | |
1450 | lrd->log.redopage.type = cpu_to_le16(LOG_INODE); | |
1451 | lrd->log.redopage.l2linesize = cpu_to_le16(L2INODESLOTSIZE); | |
1452 | ||
1453 | pxd = &lrd->log.redopage.pxd; | |
1454 | ||
1455 | /* | |
f720e3ba | 1456 | * inode after image |
1da177e4 LT |
1457 | */ |
1458 | if (tlck->type & tlckENTRY) { | |
1459 | /* log after-image for logredo(): */ | |
1460 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
1da177e4 LT |
1461 | PXDaddress(pxd, mp->index); |
1462 | PXDlength(pxd, | |
1463 | mp->logical_size >> tblk->sb->s_blocksize_bits); | |
1464 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1465 | ||
1466 | /* mark page as homeward bound */ | |
1467 | tlck->flag |= tlckWRITEPAGE; | |
1468 | } else if (tlck->type & tlckFREE) { | |
1469 | /* | |
f720e3ba | 1470 | * free inode extent |
1da177e4 LT |
1471 | * |
1472 | * (pages of the freed inode extent have been invalidated and | |
1473 | * a maplock for free of the extent has been formatted at | |
1474 | * txLock() time); | |
1475 | * | |
1476 | * the tlock had been acquired on the inode allocation map page | |
1477 | * (iag) that specifies the freed extent, even though the map | |
1478 | * page is not itself logged, to prevent pageout of the map | |
1479 | * page before the log; | |
1480 | */ | |
1481 | ||
1482 | /* log LOG_NOREDOINOEXT of the freed inode extent for | |
1483 | * logredo() to start NoRedoPage filters, and to update | |
1484 | * imap and bmap for free of the extent; | |
1485 | */ | |
1486 | lrd->type = cpu_to_le16(LOG_NOREDOINOEXT); | |
1487 | /* | |
1488 | * For the LOG_NOREDOINOEXT record, we need | |
1489 | * to pass the IAG number and inode extent | |
1490 | * index (within that IAG) from which the | |
1491 | * the extent being released. These have been | |
1492 | * passed to us in the iplist[1] and iplist[2]. | |
1493 | */ | |
1494 | lrd->log.noredoinoext.iagnum = | |
1495 | cpu_to_le32((u32) (size_t) cd->iplist[1]); | |
1496 | lrd->log.noredoinoext.inoext_idx = | |
1497 | cpu_to_le32((u32) (size_t) cd->iplist[2]); | |
1498 | ||
1499 | pxdlock = (struct pxd_lock *) & tlck->lock; | |
1500 | *pxd = pxdlock->pxd; | |
1501 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
1502 | ||
1503 | /* update bmap */ | |
1504 | tlck->flag |= tlckUPDATEMAP; | |
1505 | ||
1506 | /* mark page as homeward bound */ | |
1507 | tlck->flag |= tlckWRITEPAGE; | |
1508 | } else | |
1509 | jfs_err("diLog: UFO type tlck:0x%p", tlck); | |
1510 | #ifdef _JFS_WIP | |
1511 | /* | |
f720e3ba | 1512 | * alloc/free external EA extent |
1da177e4 LT |
1513 | * |
1514 | * a maplock for txUpdateMap() to update bPWMAP for alloc/free | |
1515 | * of the extent has been formatted at txLock() time; | |
1516 | */ | |
1517 | else { | |
1518 | assert(tlck->type & tlckEA); | |
1519 | ||
1520 | /* log LOG_UPDATEMAP for logredo() to update bmap for | |
1521 | * alloc of new (and free of old) external EA extent; | |
1522 | */ | |
1523 | lrd->type = cpu_to_le16(LOG_UPDATEMAP); | |
1524 | pxdlock = (struct pxd_lock *) & tlck->lock; | |
1525 | nlock = pxdlock->index; | |
1526 | for (i = 0; i < nlock; i++, pxdlock++) { | |
1527 | if (pxdlock->flag & mlckALLOCPXD) | |
1528 | lrd->log.updatemap.type = | |
1529 | cpu_to_le16(LOG_ALLOCPXD); | |
1530 | else | |
1531 | lrd->log.updatemap.type = | |
1532 | cpu_to_le16(LOG_FREEPXD); | |
1533 | lrd->log.updatemap.nxd = cpu_to_le16(1); | |
1534 | lrd->log.updatemap.pxd = pxdlock->pxd; | |
1535 | lrd->backchain = | |
1536 | cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
1537 | } | |
1538 | ||
1539 | /* update bmap */ | |
1540 | tlck->flag |= tlckUPDATEMAP; | |
1541 | } | |
1542 | #endif /* _JFS_WIP */ | |
1543 | ||
1544 | return rc; | |
1545 | } | |
1546 | ||
1da177e4 | 1547 | /* |
f720e3ba | 1548 | * dataLog() |
1da177e4 | 1549 | * |
f720e3ba | 1550 | * function: log data tlock |
1da177e4 LT |
1551 | */ |
1552 | static int dataLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd, | |
1553 | struct tlock * tlck) | |
1554 | { | |
1555 | struct metapage *mp; | |
1556 | pxd_t *pxd; | |
1557 | ||
1558 | mp = tlck->mp; | |
1559 | ||
1560 | /* initialize as REDOPAGE record format */ | |
1561 | lrd->log.redopage.type = cpu_to_le16(LOG_DATA); | |
1562 | lrd->log.redopage.l2linesize = cpu_to_le16(L2DATASLOTSIZE); | |
1563 | ||
1564 | pxd = &lrd->log.redopage.pxd; | |
1565 | ||
1566 | /* log after-image for logredo(): */ | |
1567 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
1568 | ||
1569 | if (jfs_dirtable_inline(tlck->ip)) { | |
1570 | /* | |
1571 | * The table has been truncated, we've must have deleted | |
1572 | * the last entry, so don't bother logging this | |
1573 | */ | |
1574 | mp->lid = 0; | |
7fab479b DK |
1575 | grab_metapage(mp); |
1576 | metapage_homeok(mp); | |
1da177e4 LT |
1577 | discard_metapage(mp); |
1578 | tlck->mp = NULL; | |
1579 | return 0; | |
1580 | } | |
1581 | ||
1582 | PXDaddress(pxd, mp->index); | |
1583 | PXDlength(pxd, mp->logical_size >> tblk->sb->s_blocksize_bits); | |
1584 | ||
1585 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1586 | ||
1587 | /* mark page as homeward bound */ | |
1588 | tlck->flag |= tlckWRITEPAGE; | |
1589 | ||
1590 | return 0; | |
1591 | } | |
1592 | ||
1da177e4 | 1593 | /* |
f720e3ba | 1594 | * dtLog() |
1da177e4 | 1595 | * |
f720e3ba | 1596 | * function: log dtree tlock and format maplock to update bmap; |
1da177e4 LT |
1597 | */ |
1598 | static void dtLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd, | |
1599 | struct tlock * tlck) | |
1600 | { | |
1601 | struct metapage *mp; | |
1602 | struct pxd_lock *pxdlock; | |
1603 | pxd_t *pxd; | |
1604 | ||
1605 | mp = tlck->mp; | |
1606 | ||
1607 | /* initialize as REDOPAGE/NOREDOPAGE record format */ | |
1608 | lrd->log.redopage.type = cpu_to_le16(LOG_DTREE); | |
1609 | lrd->log.redopage.l2linesize = cpu_to_le16(L2DTSLOTSIZE); | |
1610 | ||
1611 | pxd = &lrd->log.redopage.pxd; | |
1612 | ||
1613 | if (tlck->type & tlckBTROOT) | |
1614 | lrd->log.redopage.type |= cpu_to_le16(LOG_BTROOT); | |
1615 | ||
1616 | /* | |
f720e3ba DK |
1617 | * page extension via relocation: entry insertion; |
1618 | * page extension in-place: entry insertion; | |
1619 | * new right page from page split, reinitialized in-line | |
1620 | * root from root page split: entry insertion; | |
1da177e4 LT |
1621 | */ |
1622 | if (tlck->type & (tlckNEW | tlckEXTEND)) { | |
1623 | /* log after-image of the new page for logredo(): | |
1624 | * mark log (LOG_NEW) for logredo() to initialize | |
1625 | * freelist and update bmap for alloc of the new page; | |
1626 | */ | |
1627 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
1628 | if (tlck->type & tlckEXTEND) | |
1629 | lrd->log.redopage.type |= cpu_to_le16(LOG_EXTEND); | |
1630 | else | |
1631 | lrd->log.redopage.type |= cpu_to_le16(LOG_NEW); | |
1da177e4 LT |
1632 | PXDaddress(pxd, mp->index); |
1633 | PXDlength(pxd, | |
1634 | mp->logical_size >> tblk->sb->s_blocksize_bits); | |
1635 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1636 | ||
1637 | /* format a maplock for txUpdateMap() to update bPMAP for | |
1638 | * alloc of the new page; | |
1639 | */ | |
1640 | if (tlck->type & tlckBTROOT) | |
1641 | return; | |
1642 | tlck->flag |= tlckUPDATEMAP; | |
1643 | pxdlock = (struct pxd_lock *) & tlck->lock; | |
1644 | pxdlock->flag = mlckALLOCPXD; | |
1645 | pxdlock->pxd = *pxd; | |
1646 | ||
1647 | pxdlock->index = 1; | |
1648 | ||
1649 | /* mark page as homeward bound */ | |
1650 | tlck->flag |= tlckWRITEPAGE; | |
1651 | return; | |
1652 | } | |
1653 | ||
1654 | /* | |
f720e3ba DK |
1655 | * entry insertion/deletion, |
1656 | * sibling page link update (old right page before split); | |
1da177e4 LT |
1657 | */ |
1658 | if (tlck->type & (tlckENTRY | tlckRELINK)) { | |
1659 | /* log after-image for logredo(): */ | |
1660 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
1661 | PXDaddress(pxd, mp->index); | |
1662 | PXDlength(pxd, | |
1663 | mp->logical_size >> tblk->sb->s_blocksize_bits); | |
1664 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1665 | ||
1666 | /* mark page as homeward bound */ | |
1667 | tlck->flag |= tlckWRITEPAGE; | |
1668 | return; | |
1669 | } | |
1670 | ||
1671 | /* | |
f720e3ba DK |
1672 | * page deletion: page has been invalidated |
1673 | * page relocation: source extent | |
1da177e4 | 1674 | * |
f720e3ba DK |
1675 | * a maplock for free of the page has been formatted |
1676 | * at txLock() time); | |
1da177e4 LT |
1677 | */ |
1678 | if (tlck->type & (tlckFREE | tlckRELOCATE)) { | |
1679 | /* log LOG_NOREDOPAGE of the deleted page for logredo() | |
1680 | * to start NoRedoPage filter and to update bmap for free | |
1681 | * of the deletd page | |
1682 | */ | |
1683 | lrd->type = cpu_to_le16(LOG_NOREDOPAGE); | |
1684 | pxdlock = (struct pxd_lock *) & tlck->lock; | |
1685 | *pxd = pxdlock->pxd; | |
1686 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
1687 | ||
1688 | /* a maplock for txUpdateMap() for free of the page | |
1689 | * has been formatted at txLock() time; | |
1690 | */ | |
1691 | tlck->flag |= tlckUPDATEMAP; | |
1692 | } | |
1693 | return; | |
1694 | } | |
1695 | ||
1da177e4 | 1696 | /* |
f720e3ba | 1697 | * xtLog() |
1da177e4 | 1698 | * |
f720e3ba | 1699 | * function: log xtree tlock and format maplock to update bmap; |
1da177e4 LT |
1700 | */ |
1701 | static void xtLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd, | |
1702 | struct tlock * tlck) | |
1703 | { | |
1704 | struct inode *ip; | |
1705 | struct metapage *mp; | |
1706 | xtpage_t *p; | |
1707 | struct xtlock *xtlck; | |
1708 | struct maplock *maplock; | |
1709 | struct xdlistlock *xadlock; | |
1710 | struct pxd_lock *pxdlock; | |
66f3131f | 1711 | pxd_t *page_pxd; |
1da177e4 LT |
1712 | int next, lwm, hwm; |
1713 | ||
1714 | ip = tlck->ip; | |
1715 | mp = tlck->mp; | |
1716 | ||
1717 | /* initialize as REDOPAGE/NOREDOPAGE record format */ | |
1718 | lrd->log.redopage.type = cpu_to_le16(LOG_XTREE); | |
1719 | lrd->log.redopage.l2linesize = cpu_to_le16(L2XTSLOTSIZE); | |
1720 | ||
66f3131f | 1721 | page_pxd = &lrd->log.redopage.pxd; |
1da177e4 LT |
1722 | |
1723 | if (tlck->type & tlckBTROOT) { | |
1724 | lrd->log.redopage.type |= cpu_to_le16(LOG_BTROOT); | |
1725 | p = &JFS_IP(ip)->i_xtroot; | |
1726 | if (S_ISDIR(ip->i_mode)) | |
1727 | lrd->log.redopage.type |= | |
1728 | cpu_to_le16(LOG_DIR_XTREE); | |
1729 | } else | |
1730 | p = (xtpage_t *) mp->data; | |
1731 | next = le16_to_cpu(p->header.nextindex); | |
1732 | ||
1733 | xtlck = (struct xtlock *) & tlck->lock; | |
1734 | ||
1735 | maplock = (struct maplock *) & tlck->lock; | |
1736 | xadlock = (struct xdlistlock *) maplock; | |
1737 | ||
1738 | /* | |
f720e3ba DK |
1739 | * entry insertion/extension; |
1740 | * sibling page link update (old right page before split); | |
1da177e4 LT |
1741 | */ |
1742 | if (tlck->type & (tlckNEW | tlckGROW | tlckRELINK)) { | |
1743 | /* log after-image for logredo(): | |
1744 | * logredo() will update bmap for alloc of new/extended | |
1745 | * extents (XAD_NEW|XAD_EXTEND) of XAD[lwm:next) from | |
1746 | * after-image of XADlist; | |
1747 | * logredo() resets (XAD_NEW|XAD_EXTEND) flag when | |
1748 | * applying the after-image to the meta-data page. | |
1749 | */ | |
1750 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
66f3131f DK |
1751 | PXDaddress(page_pxd, mp->index); |
1752 | PXDlength(page_pxd, | |
1da177e4 LT |
1753 | mp->logical_size >> tblk->sb->s_blocksize_bits); |
1754 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1755 | ||
1756 | /* format a maplock for txUpdateMap() to update bPMAP | |
1757 | * for alloc of new/extended extents of XAD[lwm:next) | |
1758 | * from the page itself; | |
1759 | * txUpdateMap() resets (XAD_NEW|XAD_EXTEND) flag. | |
1760 | */ | |
1761 | lwm = xtlck->lwm.offset; | |
1762 | if (lwm == 0) | |
1763 | lwm = XTPAGEMAXSLOT; | |
1764 | ||
1765 | if (lwm == next) | |
1766 | goto out; | |
1767 | if (lwm > next) { | |
1768 | jfs_err("xtLog: lwm > next\n"); | |
1769 | goto out; | |
1770 | } | |
1771 | tlck->flag |= tlckUPDATEMAP; | |
1772 | xadlock->flag = mlckALLOCXADLIST; | |
1773 | xadlock->count = next - lwm; | |
66f3131f | 1774 | if ((xadlock->count <= 4) && (tblk->xflag & COMMIT_LAZY)) { |
1da177e4 | 1775 | int i; |
66f3131f | 1776 | pxd_t *pxd; |
1da177e4 LT |
1777 | /* |
1778 | * Lazy commit may allow xtree to be modified before | |
1779 | * txUpdateMap runs. Copy xad into linelock to | |
1780 | * preserve correct data. | |
66f3131f DK |
1781 | * |
1782 | * We can fit twice as may pxd's as xads in the lock | |
1da177e4 | 1783 | */ |
66f3131f DK |
1784 | xadlock->flag = mlckALLOCPXDLIST; |
1785 | pxd = xadlock->xdlist = &xtlck->pxdlock; | |
1786 | for (i = 0; i < xadlock->count; i++) { | |
1787 | PXDaddress(pxd, addressXAD(&p->xad[lwm + i])); | |
1788 | PXDlength(pxd, lengthXAD(&p->xad[lwm + i])); | |
1da177e4 LT |
1789 | p->xad[lwm + i].flag &= |
1790 | ~(XAD_NEW | XAD_EXTENDED); | |
66f3131f DK |
1791 | pxd++; |
1792 | } | |
1da177e4 LT |
1793 | } else { |
1794 | /* | |
1795 | * xdlist will point to into inode's xtree, ensure | |
1796 | * that transaction is not committed lazily. | |
1797 | */ | |
66f3131f | 1798 | xadlock->flag = mlckALLOCXADLIST; |
1da177e4 LT |
1799 | xadlock->xdlist = &p->xad[lwm]; |
1800 | tblk->xflag &= ~COMMIT_LAZY; | |
1801 | } | |
1802 | jfs_info("xtLog: alloc ip:0x%p mp:0x%p tlck:0x%p lwm:%d " | |
1803 | "count:%d", tlck->ip, mp, tlck, lwm, xadlock->count); | |
1804 | ||
1805 | maplock->index = 1; | |
1806 | ||
1807 | out: | |
1808 | /* mark page as homeward bound */ | |
1809 | tlck->flag |= tlckWRITEPAGE; | |
1810 | ||
1811 | return; | |
1812 | } | |
1813 | ||
1814 | /* | |
f720e3ba | 1815 | * page deletion: file deletion/truncation (ref. xtTruncate()) |
1da177e4 LT |
1816 | * |
1817 | * (page will be invalidated after log is written and bmap | |
1818 | * is updated from the page); | |
1819 | */ | |
1820 | if (tlck->type & tlckFREE) { | |
1821 | /* LOG_NOREDOPAGE log for NoRedoPage filter: | |
1822 | * if page free from file delete, NoRedoFile filter from | |
1823 | * inode image of zero link count will subsume NoRedoPage | |
1824 | * filters for each page; | |
1825 | * if page free from file truncattion, write NoRedoPage | |
1826 | * filter; | |
1827 | * | |
1828 | * upadte of block allocation map for the page itself: | |
1829 | * if page free from deletion and truncation, LOG_UPDATEMAP | |
1830 | * log for the page itself is generated from processing | |
1831 | * its parent page xad entries; | |
1832 | */ | |
1833 | /* if page free from file truncation, log LOG_NOREDOPAGE | |
1834 | * of the deleted page for logredo() to start NoRedoPage | |
1835 | * filter for the page; | |
1836 | */ | |
1837 | if (tblk->xflag & COMMIT_TRUNCATE) { | |
1838 | /* write NOREDOPAGE for the page */ | |
1839 | lrd->type = cpu_to_le16(LOG_NOREDOPAGE); | |
66f3131f DK |
1840 | PXDaddress(page_pxd, mp->index); |
1841 | PXDlength(page_pxd, | |
1da177e4 LT |
1842 | mp->logical_size >> tblk->sb-> |
1843 | s_blocksize_bits); | |
1844 | lrd->backchain = | |
1845 | cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
1846 | ||
1847 | if (tlck->type & tlckBTROOT) { | |
1848 | /* Empty xtree must be logged */ | |
1849 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
1850 | lrd->backchain = | |
1851 | cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1852 | } | |
1853 | } | |
1854 | ||
1855 | /* init LOG_UPDATEMAP of the freed extents | |
1856 | * XAD[XTENTRYSTART:hwm) from the deleted page itself | |
1857 | * for logredo() to update bmap; | |
1858 | */ | |
1859 | lrd->type = cpu_to_le16(LOG_UPDATEMAP); | |
1860 | lrd->log.updatemap.type = cpu_to_le16(LOG_FREEXADLIST); | |
1861 | xtlck = (struct xtlock *) & tlck->lock; | |
1862 | hwm = xtlck->hwm.offset; | |
1863 | lrd->log.updatemap.nxd = | |
1864 | cpu_to_le16(hwm - XTENTRYSTART + 1); | |
1865 | /* reformat linelock for lmLog() */ | |
1866 | xtlck->header.offset = XTENTRYSTART; | |
1867 | xtlck->header.length = hwm - XTENTRYSTART + 1; | |
1868 | xtlck->index = 1; | |
1869 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
1870 | ||
1871 | /* format a maplock for txUpdateMap() to update bmap | |
1872 | * to free extents of XAD[XTENTRYSTART:hwm) from the | |
1873 | * deleted page itself; | |
1874 | */ | |
1875 | tlck->flag |= tlckUPDATEMAP; | |
1da177e4 | 1876 | xadlock->count = hwm - XTENTRYSTART + 1; |
66f3131f DK |
1877 | if ((xadlock->count <= 4) && (tblk->xflag & COMMIT_LAZY)) { |
1878 | int i; | |
1879 | pxd_t *pxd; | |
1da177e4 LT |
1880 | /* |
1881 | * Lazy commit may allow xtree to be modified before | |
1882 | * txUpdateMap runs. Copy xad into linelock to | |
1883 | * preserve correct data. | |
66f3131f DK |
1884 | * |
1885 | * We can fit twice as may pxd's as xads in the lock | |
1da177e4 | 1886 | */ |
66f3131f DK |
1887 | xadlock->flag = mlckFREEPXDLIST; |
1888 | pxd = xadlock->xdlist = &xtlck->pxdlock; | |
1889 | for (i = 0; i < xadlock->count; i++) { | |
1890 | PXDaddress(pxd, | |
1891 | addressXAD(&p->xad[XTENTRYSTART + i])); | |
1892 | PXDlength(pxd, | |
1893 | lengthXAD(&p->xad[XTENTRYSTART + i])); | |
1894 | pxd++; | |
1895 | } | |
1da177e4 LT |
1896 | } else { |
1897 | /* | |
1898 | * xdlist will point to into inode's xtree, ensure | |
1899 | * that transaction is not committed lazily. | |
1900 | */ | |
66f3131f | 1901 | xadlock->flag = mlckFREEXADLIST; |
1da177e4 LT |
1902 | xadlock->xdlist = &p->xad[XTENTRYSTART]; |
1903 | tblk->xflag &= ~COMMIT_LAZY; | |
1904 | } | |
1905 | jfs_info("xtLog: free ip:0x%p mp:0x%p count:%d lwm:2", | |
1906 | tlck->ip, mp, xadlock->count); | |
1907 | ||
1908 | maplock->index = 1; | |
1909 | ||
1910 | /* mark page as invalid */ | |
1911 | if (((tblk->xflag & COMMIT_PWMAP) || S_ISDIR(ip->i_mode)) | |
1912 | && !(tlck->type & tlckBTROOT)) | |
1913 | tlck->flag |= tlckFREEPAGE; | |
1914 | /* | |
1915 | else (tblk->xflag & COMMIT_PMAP) | |
1916 | ? release the page; | |
1917 | */ | |
1918 | return; | |
1919 | } | |
1920 | ||
1921 | /* | |
f720e3ba | 1922 | * page/entry truncation: file truncation (ref. xtTruncate()) |
1da177e4 | 1923 | * |
f720e3ba DK |
1924 | * |----------+------+------+---------------| |
1925 | * | | | | |
1926 | * | | hwm - hwm before truncation | |
1927 | * | next - truncation point | |
1928 | * lwm - lwm before truncation | |
1da177e4 LT |
1929 | * header ? |
1930 | */ | |
1931 | if (tlck->type & tlckTRUNCATE) { | |
c9e3ad60 DK |
1932 | /* This odd declaration suppresses a bogus gcc warning */ |
1933 | pxd_t pxd = pxd; /* truncated extent of xad */ | |
1da177e4 LT |
1934 | int twm; |
1935 | ||
1936 | /* | |
1937 | * For truncation the entire linelock may be used, so it would | |
1938 | * be difficult to store xad list in linelock itself. | |
1939 | * Therefore, we'll just force transaction to be committed | |
1940 | * synchronously, so that xtree pages won't be changed before | |
1941 | * txUpdateMap runs. | |
1942 | */ | |
1943 | tblk->xflag &= ~COMMIT_LAZY; | |
1944 | lwm = xtlck->lwm.offset; | |
1945 | if (lwm == 0) | |
1946 | lwm = XTPAGEMAXSLOT; | |
1947 | hwm = xtlck->hwm.offset; | |
1948 | twm = xtlck->twm.offset; | |
1949 | ||
1950 | /* | |
f720e3ba | 1951 | * write log records |
1da177e4 LT |
1952 | */ |
1953 | /* log after-image for logredo(): | |
1954 | * | |
1955 | * logredo() will update bmap for alloc of new/extended | |
1956 | * extents (XAD_NEW|XAD_EXTEND) of XAD[lwm:next) from | |
1957 | * after-image of XADlist; | |
1958 | * logredo() resets (XAD_NEW|XAD_EXTEND) flag when | |
1959 | * applying the after-image to the meta-data page. | |
1960 | */ | |
1961 | lrd->type = cpu_to_le16(LOG_REDOPAGE); | |
66f3131f DK |
1962 | PXDaddress(page_pxd, mp->index); |
1963 | PXDlength(page_pxd, | |
1964 | mp->logical_size >> tblk->sb->s_blocksize_bits); | |
1da177e4 LT |
1965 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, tlck)); |
1966 | ||
1967 | /* | |
1968 | * truncate entry XAD[twm == next - 1]: | |
1969 | */ | |
1970 | if (twm == next - 1) { | |
1971 | /* init LOG_UPDATEMAP for logredo() to update bmap for | |
1972 | * free of truncated delta extent of the truncated | |
1973 | * entry XAD[next - 1]: | |
1974 | * (xtlck->pxdlock = truncated delta extent); | |
1975 | */ | |
1976 | pxdlock = (struct pxd_lock *) & xtlck->pxdlock; | |
1977 | /* assert(pxdlock->type & tlckTRUNCATE); */ | |
1978 | lrd->type = cpu_to_le16(LOG_UPDATEMAP); | |
1979 | lrd->log.updatemap.type = cpu_to_le16(LOG_FREEPXD); | |
1980 | lrd->log.updatemap.nxd = cpu_to_le16(1); | |
1981 | lrd->log.updatemap.pxd = pxdlock->pxd; | |
66f3131f | 1982 | pxd = pxdlock->pxd; /* save to format maplock */ |
1da177e4 LT |
1983 | lrd->backchain = |
1984 | cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
1985 | } | |
1986 | ||
1987 | /* | |
1988 | * free entries XAD[next:hwm]: | |
1989 | */ | |
1990 | if (hwm >= next) { | |
1991 | /* init LOG_UPDATEMAP of the freed extents | |
1992 | * XAD[next:hwm] from the deleted page itself | |
1993 | * for logredo() to update bmap; | |
1994 | */ | |
1995 | lrd->type = cpu_to_le16(LOG_UPDATEMAP); | |
1996 | lrd->log.updatemap.type = | |
1997 | cpu_to_le16(LOG_FREEXADLIST); | |
1998 | xtlck = (struct xtlock *) & tlck->lock; | |
1999 | hwm = xtlck->hwm.offset; | |
2000 | lrd->log.updatemap.nxd = | |
2001 | cpu_to_le16(hwm - next + 1); | |
2002 | /* reformat linelock for lmLog() */ | |
2003 | xtlck->header.offset = next; | |
2004 | xtlck->header.length = hwm - next + 1; | |
2005 | xtlck->index = 1; | |
2006 | lrd->backchain = | |
2007 | cpu_to_le32(lmLog(log, tblk, lrd, tlck)); | |
2008 | } | |
2009 | ||
2010 | /* | |
f720e3ba | 2011 | * format maplock(s) for txUpdateMap() to update bmap |
1da177e4 LT |
2012 | */ |
2013 | maplock->index = 0; | |
2014 | ||
2015 | /* | |
2016 | * allocate entries XAD[lwm:next): | |
2017 | */ | |
2018 | if (lwm < next) { | |
2019 | /* format a maplock for txUpdateMap() to update bPMAP | |
2020 | * for alloc of new/extended extents of XAD[lwm:next) | |
2021 | * from the page itself; | |
2022 | * txUpdateMap() resets (XAD_NEW|XAD_EXTEND) flag. | |
2023 | */ | |
2024 | tlck->flag |= tlckUPDATEMAP; | |
2025 | xadlock->flag = mlckALLOCXADLIST; | |
2026 | xadlock->count = next - lwm; | |
2027 | xadlock->xdlist = &p->xad[lwm]; | |
2028 | ||
2029 | jfs_info("xtLog: alloc ip:0x%p mp:0x%p count:%d " | |
2030 | "lwm:%d next:%d", | |
2031 | tlck->ip, mp, xadlock->count, lwm, next); | |
2032 | maplock->index++; | |
2033 | xadlock++; | |
2034 | } | |
2035 | ||
2036 | /* | |
2037 | * truncate entry XAD[twm == next - 1]: | |
2038 | */ | |
2039 | if (twm == next - 1) { | |
1da177e4 LT |
2040 | /* format a maplock for txUpdateMap() to update bmap |
2041 | * to free truncated delta extent of the truncated | |
2042 | * entry XAD[next - 1]; | |
2043 | * (xtlck->pxdlock = truncated delta extent); | |
2044 | */ | |
2045 | tlck->flag |= tlckUPDATEMAP; | |
2046 | pxdlock = (struct pxd_lock *) xadlock; | |
2047 | pxdlock->flag = mlckFREEPXD; | |
2048 | pxdlock->count = 1; | |
66f3131f | 2049 | pxdlock->pxd = pxd; |
1da177e4 LT |
2050 | |
2051 | jfs_info("xtLog: truncate ip:0x%p mp:0x%p count:%d " | |
2052 | "hwm:%d", ip, mp, pxdlock->count, hwm); | |
2053 | maplock->index++; | |
2054 | xadlock++; | |
2055 | } | |
2056 | ||
2057 | /* | |
2058 | * free entries XAD[next:hwm]: | |
2059 | */ | |
2060 | if (hwm >= next) { | |
2061 | /* format a maplock for txUpdateMap() to update bmap | |
2062 | * to free extents of XAD[next:hwm] from thedeleted | |
2063 | * page itself; | |
2064 | */ | |
2065 | tlck->flag |= tlckUPDATEMAP; | |
2066 | xadlock->flag = mlckFREEXADLIST; | |
2067 | xadlock->count = hwm - next + 1; | |
2068 | xadlock->xdlist = &p->xad[next]; | |
2069 | ||
2070 | jfs_info("xtLog: free ip:0x%p mp:0x%p count:%d " | |
2071 | "next:%d hwm:%d", | |
2072 | tlck->ip, mp, xadlock->count, next, hwm); | |
2073 | maplock->index++; | |
2074 | } | |
2075 | ||
2076 | /* mark page as homeward bound */ | |
2077 | tlck->flag |= tlckWRITEPAGE; | |
2078 | } | |
2079 | return; | |
2080 | } | |
2081 | ||
1da177e4 | 2082 | /* |
f720e3ba | 2083 | * mapLog() |
1da177e4 | 2084 | * |
f720e3ba | 2085 | * function: log from maplock of freed data extents; |
1da177e4 | 2086 | */ |
6cb1269b DK |
2087 | static void mapLog(struct jfs_log * log, struct tblock * tblk, struct lrd * lrd, |
2088 | struct tlock * tlck) | |
1da177e4 LT |
2089 | { |
2090 | struct pxd_lock *pxdlock; | |
2091 | int i, nlock; | |
2092 | pxd_t *pxd; | |
2093 | ||
2094 | /* | |
f720e3ba | 2095 | * page relocation: free the source page extent |
1da177e4 LT |
2096 | * |
2097 | * a maplock for txUpdateMap() for free of the page | |
2098 | * has been formatted at txLock() time saving the src | |
2099 | * relocated page address; | |
2100 | */ | |
2101 | if (tlck->type & tlckRELOCATE) { | |
2102 | /* log LOG_NOREDOPAGE of the old relocated page | |
2103 | * for logredo() to start NoRedoPage filter; | |
2104 | */ | |
2105 | lrd->type = cpu_to_le16(LOG_NOREDOPAGE); | |
2106 | pxdlock = (struct pxd_lock *) & tlck->lock; | |
2107 | pxd = &lrd->log.redopage.pxd; | |
2108 | *pxd = pxdlock->pxd; | |
2109 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
2110 | ||
2111 | /* (N.B. currently, logredo() does NOT update bmap | |
2112 | * for free of the page itself for (LOG_XTREE|LOG_NOREDOPAGE); | |
2113 | * if page free from relocation, LOG_UPDATEMAP log is | |
2114 | * specifically generated now for logredo() | |
2115 | * to update bmap for free of src relocated page; | |
2116 | * (new flag LOG_RELOCATE may be introduced which will | |
2117 | * inform logredo() to start NORedoPage filter and also | |
2118 | * update block allocation map at the same time, thus | |
2119 | * avoiding an extra log write); | |
2120 | */ | |
2121 | lrd->type = cpu_to_le16(LOG_UPDATEMAP); | |
2122 | lrd->log.updatemap.type = cpu_to_le16(LOG_FREEPXD); | |
2123 | lrd->log.updatemap.nxd = cpu_to_le16(1); | |
2124 | lrd->log.updatemap.pxd = pxdlock->pxd; | |
2125 | lrd->backchain = cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
2126 | ||
2127 | /* a maplock for txUpdateMap() for free of the page | |
2128 | * has been formatted at txLock() time; | |
2129 | */ | |
2130 | tlck->flag |= tlckUPDATEMAP; | |
2131 | return; | |
2132 | } | |
2133 | /* | |
2134 | ||
2135 | * Otherwise it's not a relocate request | |
2136 | * | |
2137 | */ | |
2138 | else { | |
2139 | /* log LOG_UPDATEMAP for logredo() to update bmap for | |
2140 | * free of truncated/relocated delta extent of the data; | |
2141 | * e.g.: external EA extent, relocated/truncated extent | |
2142 | * from xtTailgate(); | |
2143 | */ | |
2144 | lrd->type = cpu_to_le16(LOG_UPDATEMAP); | |
2145 | pxdlock = (struct pxd_lock *) & tlck->lock; | |
2146 | nlock = pxdlock->index; | |
2147 | for (i = 0; i < nlock; i++, pxdlock++) { | |
2148 | if (pxdlock->flag & mlckALLOCPXD) | |
2149 | lrd->log.updatemap.type = | |
2150 | cpu_to_le16(LOG_ALLOCPXD); | |
2151 | else | |
2152 | lrd->log.updatemap.type = | |
2153 | cpu_to_le16(LOG_FREEPXD); | |
2154 | lrd->log.updatemap.nxd = cpu_to_le16(1); | |
2155 | lrd->log.updatemap.pxd = pxdlock->pxd; | |
2156 | lrd->backchain = | |
2157 | cpu_to_le32(lmLog(log, tblk, lrd, NULL)); | |
2158 | jfs_info("mapLog: xaddr:0x%lx xlen:0x%x", | |
2159 | (ulong) addressPXD(&pxdlock->pxd), | |
2160 | lengthPXD(&pxdlock->pxd)); | |
2161 | } | |
2162 | ||
2163 | /* update bmap */ | |
2164 | tlck->flag |= tlckUPDATEMAP; | |
2165 | } | |
2166 | } | |
2167 | ||
1da177e4 | 2168 | /* |
f720e3ba | 2169 | * txEA() |
1da177e4 | 2170 | * |
f720e3ba DK |
2171 | * function: acquire maplock for EA/ACL extents or |
2172 | * set COMMIT_INLINE flag; | |
1da177e4 LT |
2173 | */ |
2174 | void txEA(tid_t tid, struct inode *ip, dxd_t * oldea, dxd_t * newea) | |
2175 | { | |
2176 | struct tlock *tlck = NULL; | |
2177 | struct pxd_lock *maplock = NULL, *pxdlock = NULL; | |
2178 | ||
2179 | /* | |
2180 | * format maplock for alloc of new EA extent | |
2181 | */ | |
2182 | if (newea) { | |
2183 | /* Since the newea could be a completely zeroed entry we need to | |
2184 | * check for the two flags which indicate we should actually | |
2185 | * commit new EA data | |
2186 | */ | |
2187 | if (newea->flag & DXD_EXTENT) { | |
2188 | tlck = txMaplock(tid, ip, tlckMAP); | |
2189 | maplock = (struct pxd_lock *) & tlck->lock; | |
2190 | pxdlock = (struct pxd_lock *) maplock; | |
2191 | pxdlock->flag = mlckALLOCPXD; | |
2192 | PXDaddress(&pxdlock->pxd, addressDXD(newea)); | |
2193 | PXDlength(&pxdlock->pxd, lengthDXD(newea)); | |
2194 | pxdlock++; | |
2195 | maplock->index = 1; | |
2196 | } else if (newea->flag & DXD_INLINE) { | |
2197 | tlck = NULL; | |
2198 | ||
2199 | set_cflag(COMMIT_Inlineea, ip); | |
2200 | } | |
2201 | } | |
2202 | ||
2203 | /* | |
2204 | * format maplock for free of old EA extent | |
2205 | */ | |
2206 | if (!test_cflag(COMMIT_Nolink, ip) && oldea->flag & DXD_EXTENT) { | |
2207 | if (tlck == NULL) { | |
2208 | tlck = txMaplock(tid, ip, tlckMAP); | |
2209 | maplock = (struct pxd_lock *) & tlck->lock; | |
2210 | pxdlock = (struct pxd_lock *) maplock; | |
2211 | maplock->index = 0; | |
2212 | } | |
2213 | pxdlock->flag = mlckFREEPXD; | |
2214 | PXDaddress(&pxdlock->pxd, addressDXD(oldea)); | |
2215 | PXDlength(&pxdlock->pxd, lengthDXD(oldea)); | |
2216 | maplock->index++; | |
2217 | } | |
2218 | } | |
2219 | ||
1da177e4 | 2220 | /* |
f720e3ba | 2221 | * txForce() |
1da177e4 LT |
2222 | * |
2223 | * function: synchronously write pages locked by transaction | |
f720e3ba | 2224 | * after txLog() but before txUpdateMap(); |
1da177e4 | 2225 | */ |
6cb1269b | 2226 | static void txForce(struct tblock * tblk) |
1da177e4 LT |
2227 | { |
2228 | struct tlock *tlck; | |
2229 | lid_t lid, next; | |
2230 | struct metapage *mp; | |
2231 | ||
2232 | /* | |
2233 | * reverse the order of transaction tlocks in | |
2234 | * careful update order of address index pages | |
2235 | * (right to left, bottom up) | |
2236 | */ | |
2237 | tlck = lid_to_tlock(tblk->next); | |
2238 | lid = tlck->next; | |
2239 | tlck->next = 0; | |
2240 | while (lid) { | |
2241 | tlck = lid_to_tlock(lid); | |
2242 | next = tlck->next; | |
2243 | tlck->next = tblk->next; | |
2244 | tblk->next = lid; | |
2245 | lid = next; | |
2246 | } | |
2247 | ||
2248 | /* | |
2249 | * synchronously write the page, and | |
2250 | * hold the page for txUpdateMap(); | |
2251 | */ | |
2252 | for (lid = tblk->next; lid; lid = next) { | |
2253 | tlck = lid_to_tlock(lid); | |
2254 | next = tlck->next; | |
2255 | ||
2256 | if ((mp = tlck->mp) != NULL && | |
2257 | (tlck->type & tlckBTROOT) == 0) { | |
2258 | assert(mp->xflag & COMMIT_PAGE); | |
2259 | ||
2260 | if (tlck->flag & tlckWRITEPAGE) { | |
2261 | tlck->flag &= ~tlckWRITEPAGE; | |
2262 | ||
2263 | /* do not release page to freelist */ | |
7fab479b DK |
2264 | force_metapage(mp); |
2265 | #if 0 | |
1da177e4 LT |
2266 | /* |
2267 | * The "right" thing to do here is to | |
2268 | * synchronously write the metadata. | |
2269 | * With the current implementation this | |
2270 | * is hard since write_metapage requires | |
2271 | * us to kunmap & remap the page. If we | |
2272 | * have tlocks pointing into the metadata | |
2273 | * pages, we don't want to do this. I think | |
2274 | * we can get by with synchronously writing | |
2275 | * the pages when they are released. | |
2276 | */ | |
7fab479b | 2277 | assert(mp->nohomeok); |
1da177e4 LT |
2278 | set_bit(META_dirty, &mp->flag); |
2279 | set_bit(META_sync, &mp->flag); | |
7fab479b | 2280 | #endif |
1da177e4 LT |
2281 | } |
2282 | } | |
2283 | } | |
2284 | } | |
2285 | ||
1da177e4 | 2286 | /* |
f720e3ba | 2287 | * txUpdateMap() |
1da177e4 | 2288 | * |
f720e3ba DK |
2289 | * function: update persistent allocation map (and working map |
2290 | * if appropriate); | |
1da177e4 LT |
2291 | * |
2292 | * parameter: | |
2293 | */ | |
2294 | static void txUpdateMap(struct tblock * tblk) | |
2295 | { | |
2296 | struct inode *ip; | |
2297 | struct inode *ipimap; | |
2298 | lid_t lid; | |
2299 | struct tlock *tlck; | |
2300 | struct maplock *maplock; | |
2301 | struct pxd_lock pxdlock; | |
2302 | int maptype; | |
2303 | int k, nlock; | |
2304 | struct metapage *mp = NULL; | |
2305 | ||
2306 | ipimap = JFS_SBI(tblk->sb)->ipimap; | |
2307 | ||
2308 | maptype = (tblk->xflag & COMMIT_PMAP) ? COMMIT_PMAP : COMMIT_PWMAP; | |
2309 | ||
2310 | ||
2311 | /* | |
f720e3ba | 2312 | * update block allocation map |
1da177e4 LT |
2313 | * |
2314 | * update allocation state in pmap (and wmap) and | |
2315 | * update lsn of the pmap page; | |
2316 | */ | |
2317 | /* | |
2318 | * scan each tlock/page of transaction for block allocation/free: | |
2319 | * | |
2320 | * for each tlock/page of transaction, update map. | |
2321 | * ? are there tlock for pmap and pwmap at the same time ? | |
2322 | */ | |
2323 | for (lid = tblk->next; lid; lid = tlck->next) { | |
2324 | tlck = lid_to_tlock(lid); | |
2325 | ||
2326 | if ((tlck->flag & tlckUPDATEMAP) == 0) | |
2327 | continue; | |
2328 | ||
2329 | if (tlck->flag & tlckFREEPAGE) { | |
2330 | /* | |
2331 | * Another thread may attempt to reuse freed space | |
2332 | * immediately, so we want to get rid of the metapage | |
2333 | * before anyone else has a chance to get it. | |
2334 | * Lock metapage, update maps, then invalidate | |
2335 | * the metapage. | |
2336 | */ | |
2337 | mp = tlck->mp; | |
2338 | ASSERT(mp->xflag & COMMIT_PAGE); | |
7fab479b | 2339 | grab_metapage(mp); |
1da177e4 LT |
2340 | } |
2341 | ||
2342 | /* | |
2343 | * extent list: | |
2344 | * . in-line PXD list: | |
2345 | * . out-of-line XAD list: | |
2346 | */ | |
2347 | maplock = (struct maplock *) & tlck->lock; | |
2348 | nlock = maplock->index; | |
2349 | ||
2350 | for (k = 0; k < nlock; k++, maplock++) { | |
2351 | /* | |
2352 | * allocate blocks in persistent map: | |
2353 | * | |
2354 | * blocks have been allocated from wmap at alloc time; | |
2355 | */ | |
2356 | if (maplock->flag & mlckALLOC) { | |
2357 | txAllocPMap(ipimap, maplock, tblk); | |
2358 | } | |
2359 | /* | |
2360 | * free blocks in persistent and working map: | |
2361 | * blocks will be freed in pmap and then in wmap; | |
2362 | * | |
2363 | * ? tblock specifies the PMAP/PWMAP based upon | |
2364 | * transaction | |
2365 | * | |
2366 | * free blocks in persistent map: | |
2367 | * blocks will be freed from wmap at last reference | |
2368 | * release of the object for regular files; | |
2369 | * | |
2370 | * Alway free blocks from both persistent & working | |
2371 | * maps for directories | |
2372 | */ | |
2373 | else { /* (maplock->flag & mlckFREE) */ | |
2374 | ||
438282d8 | 2375 | if (tlck->flag & tlckDIRECTORY) |
1da177e4 LT |
2376 | txFreeMap(ipimap, maplock, |
2377 | tblk, COMMIT_PWMAP); | |
2378 | else | |
2379 | txFreeMap(ipimap, maplock, | |
2380 | tblk, maptype); | |
2381 | } | |
2382 | } | |
2383 | if (tlck->flag & tlckFREEPAGE) { | |
2384 | if (!(tblk->flag & tblkGC_LAZY)) { | |
2385 | /* This is equivalent to txRelease */ | |
2386 | ASSERT(mp->lid == lid); | |
2387 | tlck->mp->lid = 0; | |
2388 | } | |
7fab479b DK |
2389 | assert(mp->nohomeok == 1); |
2390 | metapage_homeok(mp); | |
1da177e4 LT |
2391 | discard_metapage(mp); |
2392 | tlck->mp = NULL; | |
2393 | } | |
2394 | } | |
2395 | /* | |
f720e3ba | 2396 | * update inode allocation map |
1da177e4 LT |
2397 | * |
2398 | * update allocation state in pmap and | |
2399 | * update lsn of the pmap page; | |
2400 | * update in-memory inode flag/state | |
2401 | * | |
2402 | * unlock mapper/write lock | |
2403 | */ | |
2404 | if (tblk->xflag & COMMIT_CREATE) { | |
4d81715f | 2405 | diUpdatePMap(ipimap, tblk->ino, false, tblk); |
1da177e4 LT |
2406 | /* update persistent block allocation map |
2407 | * for the allocation of inode extent; | |
2408 | */ | |
2409 | pxdlock.flag = mlckALLOCPXD; | |
2410 | pxdlock.pxd = tblk->u.ixpxd; | |
2411 | pxdlock.index = 1; | |
2412 | txAllocPMap(ipimap, (struct maplock *) & pxdlock, tblk); | |
2413 | } else if (tblk->xflag & COMMIT_DELETE) { | |
2414 | ip = tblk->u.ip; | |
4d81715f | 2415 | diUpdatePMap(ipimap, ip->i_ino, true, tblk); |
1da177e4 LT |
2416 | iput(ip); |
2417 | } | |
2418 | } | |
2419 | ||
1da177e4 | 2420 | /* |
f720e3ba | 2421 | * txAllocPMap() |
1da177e4 LT |
2422 | * |
2423 | * function: allocate from persistent map; | |
2424 | * | |
2425 | * parameter: | |
f720e3ba DK |
2426 | * ipbmap - |
2427 | * malock - | |
2428 | * xad list: | |
2429 | * pxd: | |
2430 | * | |
2431 | * maptype - | |
2432 | * allocate from persistent map; | |
2433 | * free from persistent map; | |
2434 | * (e.g., tmp file - free from working map at releae | |
2435 | * of last reference); | |
2436 | * free from persistent and working map; | |
2437 | * | |
2438 | * lsn - log sequence number; | |
1da177e4 LT |
2439 | */ |
2440 | static void txAllocPMap(struct inode *ip, struct maplock * maplock, | |
2441 | struct tblock * tblk) | |
2442 | { | |
2443 | struct inode *ipbmap = JFS_SBI(ip->i_sb)->ipbmap; | |
2444 | struct xdlistlock *xadlistlock; | |
2445 | xad_t *xad; | |
2446 | s64 xaddr; | |
2447 | int xlen; | |
2448 | struct pxd_lock *pxdlock; | |
2449 | struct xdlistlock *pxdlistlock; | |
2450 | pxd_t *pxd; | |
2451 | int n; | |
2452 | ||
2453 | /* | |
2454 | * allocate from persistent map; | |
2455 | */ | |
2456 | if (maplock->flag & mlckALLOCXADLIST) { | |
2457 | xadlistlock = (struct xdlistlock *) maplock; | |
2458 | xad = xadlistlock->xdlist; | |
2459 | for (n = 0; n < xadlistlock->count; n++, xad++) { | |
2460 | if (xad->flag & (XAD_NEW | XAD_EXTENDED)) { | |
2461 | xaddr = addressXAD(xad); | |
2462 | xlen = lengthXAD(xad); | |
4d81715f | 2463 | dbUpdatePMap(ipbmap, false, xaddr, |
1da177e4 LT |
2464 | (s64) xlen, tblk); |
2465 | xad->flag &= ~(XAD_NEW | XAD_EXTENDED); | |
2466 | jfs_info("allocPMap: xaddr:0x%lx xlen:%d", | |
2467 | (ulong) xaddr, xlen); | |
2468 | } | |
2469 | } | |
2470 | } else if (maplock->flag & mlckALLOCPXD) { | |
2471 | pxdlock = (struct pxd_lock *) maplock; | |
2472 | xaddr = addressPXD(&pxdlock->pxd); | |
2473 | xlen = lengthPXD(&pxdlock->pxd); | |
4d81715f | 2474 | dbUpdatePMap(ipbmap, false, xaddr, (s64) xlen, tblk); |
1da177e4 LT |
2475 | jfs_info("allocPMap: xaddr:0x%lx xlen:%d", (ulong) xaddr, xlen); |
2476 | } else { /* (maplock->flag & mlckALLOCPXDLIST) */ | |
2477 | ||
2478 | pxdlistlock = (struct xdlistlock *) maplock; | |
2479 | pxd = pxdlistlock->xdlist; | |
2480 | for (n = 0; n < pxdlistlock->count; n++, pxd++) { | |
2481 | xaddr = addressPXD(pxd); | |
2482 | xlen = lengthPXD(pxd); | |
4d81715f | 2483 | dbUpdatePMap(ipbmap, false, xaddr, (s64) xlen, |
1da177e4 LT |
2484 | tblk); |
2485 | jfs_info("allocPMap: xaddr:0x%lx xlen:%d", | |
2486 | (ulong) xaddr, xlen); | |
2487 | } | |
2488 | } | |
2489 | } | |
2490 | ||
1da177e4 | 2491 | /* |
f720e3ba | 2492 | * txFreeMap() |
1da177e4 | 2493 | * |
f720e3ba | 2494 | * function: free from persistent and/or working map; |
1da177e4 LT |
2495 | * |
2496 | * todo: optimization | |
2497 | */ | |
2498 | void txFreeMap(struct inode *ip, | |
2499 | struct maplock * maplock, struct tblock * tblk, int maptype) | |
2500 | { | |
2501 | struct inode *ipbmap = JFS_SBI(ip->i_sb)->ipbmap; | |
2502 | struct xdlistlock *xadlistlock; | |
2503 | xad_t *xad; | |
2504 | s64 xaddr; | |
2505 | int xlen; | |
2506 | struct pxd_lock *pxdlock; | |
2507 | struct xdlistlock *pxdlistlock; | |
2508 | pxd_t *pxd; | |
2509 | int n; | |
2510 | ||
2511 | jfs_info("txFreeMap: tblk:0x%p maplock:0x%p maptype:0x%x", | |
2512 | tblk, maplock, maptype); | |
2513 | ||
2514 | /* | |
2515 | * free from persistent map; | |
2516 | */ | |
2517 | if (maptype == COMMIT_PMAP || maptype == COMMIT_PWMAP) { | |
2518 | if (maplock->flag & mlckFREEXADLIST) { | |
2519 | xadlistlock = (struct xdlistlock *) maplock; | |
2520 | xad = xadlistlock->xdlist; | |
2521 | for (n = 0; n < xadlistlock->count; n++, xad++) { | |
2522 | if (!(xad->flag & XAD_NEW)) { | |
2523 | xaddr = addressXAD(xad); | |
2524 | xlen = lengthXAD(xad); | |
4d81715f | 2525 | dbUpdatePMap(ipbmap, true, xaddr, |
1da177e4 LT |
2526 | (s64) xlen, tblk); |
2527 | jfs_info("freePMap: xaddr:0x%lx " | |
2528 | "xlen:%d", | |
2529 | (ulong) xaddr, xlen); | |
2530 | } | |
2531 | } | |
2532 | } else if (maplock->flag & mlckFREEPXD) { | |
2533 | pxdlock = (struct pxd_lock *) maplock; | |
2534 | xaddr = addressPXD(&pxdlock->pxd); | |
2535 | xlen = lengthPXD(&pxdlock->pxd); | |
4d81715f | 2536 | dbUpdatePMap(ipbmap, true, xaddr, (s64) xlen, |
1da177e4 LT |
2537 | tblk); |
2538 | jfs_info("freePMap: xaddr:0x%lx xlen:%d", | |
2539 | (ulong) xaddr, xlen); | |
2540 | } else { /* (maplock->flag & mlckALLOCPXDLIST) */ | |
2541 | ||
2542 | pxdlistlock = (struct xdlistlock *) maplock; | |
2543 | pxd = pxdlistlock->xdlist; | |
2544 | for (n = 0; n < pxdlistlock->count; n++, pxd++) { | |
2545 | xaddr = addressPXD(pxd); | |
2546 | xlen = lengthPXD(pxd); | |
4d81715f | 2547 | dbUpdatePMap(ipbmap, true, xaddr, |
1da177e4 LT |
2548 | (s64) xlen, tblk); |
2549 | jfs_info("freePMap: xaddr:0x%lx xlen:%d", | |
2550 | (ulong) xaddr, xlen); | |
2551 | } | |
2552 | } | |
2553 | } | |
2554 | ||
2555 | /* | |
2556 | * free from working map; | |
2557 | */ | |
2558 | if (maptype == COMMIT_PWMAP || maptype == COMMIT_WMAP) { | |
2559 | if (maplock->flag & mlckFREEXADLIST) { | |
2560 | xadlistlock = (struct xdlistlock *) maplock; | |
2561 | xad = xadlistlock->xdlist; | |
2562 | for (n = 0; n < xadlistlock->count; n++, xad++) { | |
2563 | xaddr = addressXAD(xad); | |
2564 | xlen = lengthXAD(xad); | |
2565 | dbFree(ip, xaddr, (s64) xlen); | |
2566 | xad->flag = 0; | |
2567 | jfs_info("freeWMap: xaddr:0x%lx xlen:%d", | |
2568 | (ulong) xaddr, xlen); | |
2569 | } | |
2570 | } else if (maplock->flag & mlckFREEPXD) { | |
2571 | pxdlock = (struct pxd_lock *) maplock; | |
2572 | xaddr = addressPXD(&pxdlock->pxd); | |
2573 | xlen = lengthPXD(&pxdlock->pxd); | |
2574 | dbFree(ip, xaddr, (s64) xlen); | |
2575 | jfs_info("freeWMap: xaddr:0x%lx xlen:%d", | |
2576 | (ulong) xaddr, xlen); | |
2577 | } else { /* (maplock->flag & mlckFREEPXDLIST) */ | |
2578 | ||
2579 | pxdlistlock = (struct xdlistlock *) maplock; | |
2580 | pxd = pxdlistlock->xdlist; | |
2581 | for (n = 0; n < pxdlistlock->count; n++, pxd++) { | |
2582 | xaddr = addressPXD(pxd); | |
2583 | xlen = lengthPXD(pxd); | |
2584 | dbFree(ip, xaddr, (s64) xlen); | |
2585 | jfs_info("freeWMap: xaddr:0x%lx xlen:%d", | |
2586 | (ulong) xaddr, xlen); | |
2587 | } | |
2588 | } | |
2589 | } | |
2590 | } | |
2591 | ||
1da177e4 | 2592 | /* |
f720e3ba | 2593 | * txFreelock() |
1da177e4 | 2594 | * |
f720e3ba | 2595 | * function: remove tlock from inode anonymous locklist |
1da177e4 LT |
2596 | */ |
2597 | void txFreelock(struct inode *ip) | |
2598 | { | |
2599 | struct jfs_inode_info *jfs_ip = JFS_IP(ip); | |
2600 | struct tlock *xtlck, *tlck; | |
2601 | lid_t xlid = 0, lid; | |
2602 | ||
2603 | if (!jfs_ip->atlhead) | |
2604 | return; | |
2605 | ||
2606 | TXN_LOCK(); | |
2607 | xtlck = (struct tlock *) &jfs_ip->atlhead; | |
2608 | ||
2609 | while ((lid = xtlck->next) != 0) { | |
2610 | tlck = lid_to_tlock(lid); | |
2611 | if (tlck->flag & tlckFREELOCK) { | |
2612 | xtlck->next = tlck->next; | |
2613 | txLockFree(lid); | |
2614 | } else { | |
2615 | xtlck = tlck; | |
2616 | xlid = lid; | |
2617 | } | |
2618 | } | |
2619 | ||
2620 | if (jfs_ip->atlhead) | |
2621 | jfs_ip->atltail = xlid; | |
2622 | else { | |
2623 | jfs_ip->atltail = 0; | |
2624 | /* | |
2625 | * If inode was on anon_list, remove it | |
2626 | */ | |
2627 | list_del_init(&jfs_ip->anon_inode_list); | |
2628 | } | |
2629 | TXN_UNLOCK(); | |
2630 | } | |
2631 | ||
1da177e4 | 2632 | /* |
f720e3ba | 2633 | * txAbort() |
1da177e4 LT |
2634 | * |
2635 | * function: abort tx before commit; | |
2636 | * | |
2637 | * frees line-locks and segment locks for all | |
2638 | * segments in comdata structure. | |
2639 | * Optionally sets state of file-system to FM_DIRTY in super-block. | |
2640 | * log age of page-frames in memory for which caller has | |
2641 | * are reset to 0 (to avoid logwarap). | |
2642 | */ | |
2643 | void txAbort(tid_t tid, int dirty) | |
2644 | { | |
2645 | lid_t lid, next; | |
2646 | struct metapage *mp; | |
2647 | struct tblock *tblk = tid_to_tblock(tid); | |
2648 | struct tlock *tlck; | |
2649 | ||
2650 | /* | |
2651 | * free tlocks of the transaction | |
2652 | */ | |
2653 | for (lid = tblk->next; lid; lid = next) { | |
2654 | tlck = lid_to_tlock(lid); | |
2655 | next = tlck->next; | |
2656 | mp = tlck->mp; | |
2657 | JFS_IP(tlck->ip)->xtlid = 0; | |
2658 | ||
2659 | if (mp) { | |
2660 | mp->lid = 0; | |
2661 | ||
2662 | /* | |
2663 | * reset lsn of page to avoid logwarap: | |
2664 | * | |
2665 | * (page may have been previously committed by another | |
2666 | * transaction(s) but has not been paged, i.e., | |
2667 | * it may be on logsync list even though it has not | |
2668 | * been logged for the current tx.) | |
2669 | */ | |
2670 | if (mp->xflag & COMMIT_PAGE && mp->lsn) | |
2671 | LogSyncRelease(mp); | |
2672 | } | |
2673 | /* insert tlock at head of freelist */ | |
2674 | TXN_LOCK(); | |
2675 | txLockFree(lid); | |
2676 | TXN_UNLOCK(); | |
2677 | } | |
2678 | ||
2679 | /* caller will free the transaction block */ | |
2680 | ||
2681 | tblk->next = tblk->last = 0; | |
2682 | ||
2683 | /* | |
2684 | * mark filesystem dirty | |
2685 | */ | |
2686 | if (dirty) | |
2687 | jfs_error(tblk->sb, "txAbort"); | |
2688 | ||
2689 | return; | |
2690 | } | |
2691 | ||
2692 | /* | |
f720e3ba | 2693 | * txLazyCommit(void) |
1da177e4 LT |
2694 | * |
2695 | * All transactions except those changing ipimap (COMMIT_FORCE) are | |
2696 | * processed by this routine. This insures that the inode and block | |
2697 | * allocation maps are updated in order. For synchronous transactions, | |
2698 | * let the user thread finish processing after txUpdateMap() is called. | |
2699 | */ | |
2700 | static void txLazyCommit(struct tblock * tblk) | |
2701 | { | |
2702 | struct jfs_log *log; | |
2703 | ||
2704 | while (((tblk->flag & tblkGC_READY) == 0) && | |
2705 | ((tblk->flag & tblkGC_UNLOCKED) == 0)) { | |
2706 | /* We must have gotten ahead of the user thread | |
2707 | */ | |
2708 | jfs_info("jfs_lazycommit: tblk 0x%p not unlocked", tblk); | |
2709 | yield(); | |
2710 | } | |
2711 | ||
2712 | jfs_info("txLazyCommit: processing tblk 0x%p", tblk); | |
2713 | ||
2714 | txUpdateMap(tblk); | |
2715 | ||
2716 | log = (struct jfs_log *) JFS_SBI(tblk->sb)->log; | |
2717 | ||
2718 | spin_lock_irq(&log->gclock); // LOGGC_LOCK | |
2719 | ||
2720 | tblk->flag |= tblkGC_COMMITTED; | |
2721 | ||
2722 | if (tblk->flag & tblkGC_READY) | |
2723 | log->gcrtc--; | |
2724 | ||
2725 | wake_up_all(&tblk->gcwait); // LOGGC_WAKEUP | |
2726 | ||
2727 | /* | |
2728 | * Can't release log->gclock until we've tested tblk->flag | |
2729 | */ | |
2730 | if (tblk->flag & tblkGC_LAZY) { | |
2731 | spin_unlock_irq(&log->gclock); // LOGGC_UNLOCK | |
2732 | txUnlock(tblk); | |
2733 | tblk->flag &= ~tblkGC_LAZY; | |
2734 | txEnd(tblk - TxBlock); /* Convert back to tid */ | |
2735 | } else | |
2736 | spin_unlock_irq(&log->gclock); // LOGGC_UNLOCK | |
2737 | ||
2738 | jfs_info("txLazyCommit: done: tblk = 0x%p", tblk); | |
2739 | } | |
2740 | ||
2741 | /* | |
f720e3ba | 2742 | * jfs_lazycommit(void) |
1da177e4 LT |
2743 | * |
2744 | * To be run as a kernel daemon. If lbmIODone is called in an interrupt | |
2745 | * context, or where blocking is not wanted, this routine will process | |
2746 | * committed transactions from the unlock queue. | |
2747 | */ | |
2748 | int jfs_lazycommit(void *arg) | |
2749 | { | |
2750 | int WorkDone; | |
2751 | struct tblock *tblk; | |
2752 | unsigned long flags; | |
2753 | struct jfs_sb_info *sbi; | |
2754 | ||
1da177e4 LT |
2755 | do { |
2756 | LAZY_LOCK(flags); | |
2757 | jfs_commit_thread_waking = 0; /* OK to wake another thread */ | |
2758 | while (!list_empty(&TxAnchor.unlock_queue)) { | |
2759 | WorkDone = 0; | |
2760 | list_for_each_entry(tblk, &TxAnchor.unlock_queue, | |
2761 | cqueue) { | |
2762 | ||
2763 | sbi = JFS_SBI(tblk->sb); | |
2764 | /* | |
2765 | * For each volume, the transactions must be | |
2766 | * handled in order. If another commit thread | |
2767 | * is handling a tblk for this superblock, | |
2768 | * skip it | |
2769 | */ | |
2770 | if (sbi->commit_state & IN_LAZYCOMMIT) | |
2771 | continue; | |
2772 | ||
2773 | sbi->commit_state |= IN_LAZYCOMMIT; | |
2774 | WorkDone = 1; | |
2775 | ||
2776 | /* | |
2777 | * Remove transaction from queue | |
2778 | */ | |
2779 | list_del(&tblk->cqueue); | |
2780 | ||
2781 | LAZY_UNLOCK(flags); | |
2782 | txLazyCommit(tblk); | |
2783 | LAZY_LOCK(flags); | |
2784 | ||
2785 | sbi->commit_state &= ~IN_LAZYCOMMIT; | |
2786 | /* | |
2787 | * Don't continue in the for loop. (We can't | |
2788 | * anyway, it's unsafe!) We want to go back to | |
2789 | * the beginning of the list. | |
2790 | */ | |
2791 | break; | |
2792 | } | |
2793 | ||
2794 | /* If there was nothing to do, don't continue */ | |
2795 | if (!WorkDone) | |
2796 | break; | |
2797 | } | |
2798 | /* In case a wakeup came while all threads were active */ | |
2799 | jfs_commit_thread_waking = 0; | |
2800 | ||
3e1d1d28 | 2801 | if (freezing(current)) { |
1da177e4 | 2802 | LAZY_UNLOCK(flags); |
3e1d1d28 | 2803 | refrigerator(); |
1da177e4 LT |
2804 | } else { |
2805 | DECLARE_WAITQUEUE(wq, current); | |
2806 | ||
2807 | add_wait_queue(&jfs_commit_thread_wait, &wq); | |
2808 | set_current_state(TASK_INTERRUPTIBLE); | |
2809 | LAZY_UNLOCK(flags); | |
2810 | schedule(); | |
3cbb1c8e | 2811 | __set_current_state(TASK_RUNNING); |
1da177e4 LT |
2812 | remove_wait_queue(&jfs_commit_thread_wait, &wq); |
2813 | } | |
91dbb4de | 2814 | } while (!kthread_should_stop()); |
1da177e4 LT |
2815 | |
2816 | if (!list_empty(&TxAnchor.unlock_queue)) | |
2817 | jfs_err("jfs_lazycommit being killed w/pending transactions!"); | |
2818 | else | |
2819 | jfs_info("jfs_lazycommit being killed\n"); | |
91dbb4de | 2820 | return 0; |
1da177e4 LT |
2821 | } |
2822 | ||
2823 | void txLazyUnlock(struct tblock * tblk) | |
2824 | { | |
2825 | unsigned long flags; | |
2826 | ||
2827 | LAZY_LOCK(flags); | |
2828 | ||
2829 | list_add_tail(&tblk->cqueue, &TxAnchor.unlock_queue); | |
2830 | /* | |
2831 | * Don't wake up a commit thread if there is already one servicing | |
2832 | * this superblock, or if the last one we woke up hasn't started yet. | |
2833 | */ | |
2834 | if (!(JFS_SBI(tblk->sb)->commit_state & IN_LAZYCOMMIT) && | |
2835 | !jfs_commit_thread_waking) { | |
2836 | jfs_commit_thread_waking = 1; | |
2837 | wake_up(&jfs_commit_thread_wait); | |
2838 | } | |
2839 | LAZY_UNLOCK(flags); | |
2840 | } | |
2841 | ||
2842 | static void LogSyncRelease(struct metapage * mp) | |
2843 | { | |
2844 | struct jfs_log *log = mp->log; | |
2845 | ||
7fab479b | 2846 | assert(mp->nohomeok); |
1da177e4 | 2847 | assert(log); |
7fab479b | 2848 | metapage_homeok(mp); |
1da177e4 LT |
2849 | } |
2850 | ||
2851 | /* | |
2852 | * txQuiesce | |
2853 | * | |
2854 | * Block all new transactions and push anonymous transactions to | |
2855 | * completion | |
2856 | * | |
2857 | * This does almost the same thing as jfs_sync below. We don't | |
2858 | * worry about deadlocking when jfs_tlocks_low is set, since we would | |
2859 | * expect jfs_sync to get us out of that jam. | |
2860 | */ | |
2861 | void txQuiesce(struct super_block *sb) | |
2862 | { | |
2863 | struct inode *ip; | |
2864 | struct jfs_inode_info *jfs_ip; | |
2865 | struct jfs_log *log = JFS_SBI(sb)->log; | |
2866 | tid_t tid; | |
2867 | ||
2868 | set_bit(log_QUIESCE, &log->flag); | |
2869 | ||
2870 | TXN_LOCK(); | |
2871 | restart: | |
2872 | while (!list_empty(&TxAnchor.anon_list)) { | |
2873 | jfs_ip = list_entry(TxAnchor.anon_list.next, | |
2874 | struct jfs_inode_info, | |
2875 | anon_inode_list); | |
2876 | ip = &jfs_ip->vfs_inode; | |
2877 | ||
2878 | /* | |
2879 | * inode will be removed from anonymous list | |
2880 | * when it is committed | |
2881 | */ | |
2882 | TXN_UNLOCK(); | |
2883 | tid = txBegin(ip->i_sb, COMMIT_INODE | COMMIT_FORCE); | |
1de87444 | 2884 | mutex_lock(&jfs_ip->commit_mutex); |
1da177e4 LT |
2885 | txCommit(tid, 1, &ip, 0); |
2886 | txEnd(tid); | |
1de87444 | 2887 | mutex_unlock(&jfs_ip->commit_mutex); |
1da177e4 LT |
2888 | /* |
2889 | * Just to be safe. I don't know how | |
2890 | * long we can run without blocking | |
2891 | */ | |
2892 | cond_resched(); | |
2893 | TXN_LOCK(); | |
2894 | } | |
2895 | ||
2896 | /* | |
2897 | * If jfs_sync is running in parallel, there could be some inodes | |
2898 | * on anon_list2. Let's check. | |
2899 | */ | |
2900 | if (!list_empty(&TxAnchor.anon_list2)) { | |
2901 | list_splice(&TxAnchor.anon_list2, &TxAnchor.anon_list); | |
2902 | INIT_LIST_HEAD(&TxAnchor.anon_list2); | |
2903 | goto restart; | |
2904 | } | |
2905 | TXN_UNLOCK(); | |
2906 | ||
2907 | /* | |
2908 | * We may need to kick off the group commit | |
2909 | */ | |
2910 | jfs_flush_journal(log, 0); | |
2911 | } | |
2912 | ||
2913 | /* | |
2914 | * txResume() | |
2915 | * | |
2916 | * Allows transactions to start again following txQuiesce | |
2917 | */ | |
2918 | void txResume(struct super_block *sb) | |
2919 | { | |
2920 | struct jfs_log *log = JFS_SBI(sb)->log; | |
2921 | ||
2922 | clear_bit(log_QUIESCE, &log->flag); | |
2923 | TXN_WAKEUP(&log->syncwait); | |
2924 | } | |
2925 | ||
2926 | /* | |
f720e3ba | 2927 | * jfs_sync(void) |
1da177e4 LT |
2928 | * |
2929 | * To be run as a kernel daemon. This is awakened when tlocks run low. | |
2930 | * We write any inodes that have anonymous tlocks so they will become | |
2931 | * available. | |
2932 | */ | |
2933 | int jfs_sync(void *arg) | |
2934 | { | |
2935 | struct inode *ip; | |
2936 | struct jfs_inode_info *jfs_ip; | |
2937 | int rc; | |
2938 | tid_t tid; | |
2939 | ||
1da177e4 LT |
2940 | do { |
2941 | /* | |
2942 | * write each inode on the anonymous inode list | |
2943 | */ | |
2944 | TXN_LOCK(); | |
2945 | while (jfs_tlocks_low && !list_empty(&TxAnchor.anon_list)) { | |
2946 | jfs_ip = list_entry(TxAnchor.anon_list.next, | |
2947 | struct jfs_inode_info, | |
2948 | anon_inode_list); | |
2949 | ip = &jfs_ip->vfs_inode; | |
2950 | ||
2951 | if (! igrab(ip)) { | |
2952 | /* | |
2953 | * Inode is being freed | |
2954 | */ | |
2955 | list_del_init(&jfs_ip->anon_inode_list); | |
48ce8b05 | 2956 | } else if (mutex_trylock(&jfs_ip->commit_mutex)) { |
1da177e4 LT |
2957 | /* |
2958 | * inode will be removed from anonymous list | |
2959 | * when it is committed | |
2960 | */ | |
2961 | TXN_UNLOCK(); | |
2962 | tid = txBegin(ip->i_sb, COMMIT_INODE); | |
2963 | rc = txCommit(tid, 1, &ip, 0); | |
2964 | txEnd(tid); | |
1de87444 | 2965 | mutex_unlock(&jfs_ip->commit_mutex); |
1da177e4 LT |
2966 | |
2967 | iput(ip); | |
2968 | /* | |
2969 | * Just to be safe. I don't know how | |
2970 | * long we can run without blocking | |
2971 | */ | |
2972 | cond_resched(); | |
2973 | TXN_LOCK(); | |
2974 | } else { | |
1de87444 | 2975 | /* We can't get the commit mutex. It may |
1da177e4 LT |
2976 | * be held by a thread waiting for tlock's |
2977 | * so let's not block here. Save it to | |
2978 | * put back on the anon_list. | |
2979 | */ | |
2980 | ||
2981 | /* Take off anon_list */ | |
2982 | list_del(&jfs_ip->anon_inode_list); | |
2983 | ||
2984 | /* Put on anon_list2 */ | |
2985 | list_add(&jfs_ip->anon_inode_list, | |
2986 | &TxAnchor.anon_list2); | |
2987 | ||
2988 | TXN_UNLOCK(); | |
2989 | iput(ip); | |
2990 | TXN_LOCK(); | |
2991 | } | |
2992 | } | |
2993 | /* Add anon_list2 back to anon_list */ | |
2994 | list_splice_init(&TxAnchor.anon_list2, &TxAnchor.anon_list); | |
2995 | ||
3e1d1d28 | 2996 | if (freezing(current)) { |
1da177e4 | 2997 | TXN_UNLOCK(); |
3e1d1d28 | 2998 | refrigerator(); |
1da177e4 | 2999 | } else { |
1da177e4 LT |
3000 | set_current_state(TASK_INTERRUPTIBLE); |
3001 | TXN_UNLOCK(); | |
3002 | schedule(); | |
3cbb1c8e | 3003 | __set_current_state(TASK_RUNNING); |
1da177e4 | 3004 | } |
91dbb4de | 3005 | } while (!kthread_should_stop()); |
1da177e4 LT |
3006 | |
3007 | jfs_info("jfs_sync being killed"); | |
91dbb4de | 3008 | return 0; |
1da177e4 LT |
3009 | } |
3010 | ||
3011 | #if defined(CONFIG_PROC_FS) && defined(CONFIG_JFS_DEBUG) | |
3012 | int jfs_txanchor_read(char *buffer, char **start, off_t offset, int length, | |
3013 | int *eof, void *data) | |
3014 | { | |
3015 | int len = 0; | |
3016 | off_t begin; | |
3017 | char *freewait; | |
3018 | char *freelockwait; | |
3019 | char *lowlockwait; | |
3020 | ||
3021 | freewait = | |
3022 | waitqueue_active(&TxAnchor.freewait) ? "active" : "empty"; | |
3023 | freelockwait = | |
3024 | waitqueue_active(&TxAnchor.freelockwait) ? "active" : "empty"; | |
3025 | lowlockwait = | |
3026 | waitqueue_active(&TxAnchor.lowlockwait) ? "active" : "empty"; | |
3027 | ||
3028 | len += sprintf(buffer, | |
3029 | "JFS TxAnchor\n" | |
3030 | "============\n" | |
3031 | "freetid = %d\n" | |
3032 | "freewait = %s\n" | |
3033 | "freelock = %d\n" | |
3034 | "freelockwait = %s\n" | |
3035 | "lowlockwait = %s\n" | |
3036 | "tlocksInUse = %d\n" | |
3037 | "jfs_tlocks_low = %d\n" | |
3038 | "unlock_queue is %sempty\n", | |
3039 | TxAnchor.freetid, | |
3040 | freewait, | |
3041 | TxAnchor.freelock, | |
3042 | freelockwait, | |
3043 | lowlockwait, | |
3044 | TxAnchor.tlocksInUse, | |
3045 | jfs_tlocks_low, | |
3046 | list_empty(&TxAnchor.unlock_queue) ? "" : "not "); | |
3047 | ||
3048 | begin = offset; | |
3049 | *start = buffer + begin; | |
3050 | len -= begin; | |
3051 | ||
3052 | if (len > length) | |
3053 | len = length; | |
3054 | else | |
3055 | *eof = 1; | |
3056 | ||
3057 | if (len < 0) | |
3058 | len = 0; | |
3059 | ||
3060 | return len; | |
3061 | } | |
3062 | #endif | |
3063 | ||
3064 | #if defined(CONFIG_PROC_FS) && defined(CONFIG_JFS_STATISTICS) | |
3065 | int jfs_txstats_read(char *buffer, char **start, off_t offset, int length, | |
3066 | int *eof, void *data) | |
3067 | { | |
3068 | int len = 0; | |
3069 | off_t begin; | |
3070 | ||
3071 | len += sprintf(buffer, | |
3072 | "JFS TxStats\n" | |
3073 | "===========\n" | |
3074 | "calls to txBegin = %d\n" | |
3075 | "txBegin blocked by sync barrier = %d\n" | |
3076 | "txBegin blocked by tlocks low = %d\n" | |
3077 | "txBegin blocked by no free tid = %d\n" | |
3078 | "calls to txBeginAnon = %d\n" | |
3079 | "txBeginAnon blocked by sync barrier = %d\n" | |
3080 | "txBeginAnon blocked by tlocks low = %d\n" | |
3081 | "calls to txLockAlloc = %d\n" | |
3082 | "tLockAlloc blocked by no free lock = %d\n", | |
3083 | TxStat.txBegin, | |
3084 | TxStat.txBegin_barrier, | |
3085 | TxStat.txBegin_lockslow, | |
3086 | TxStat.txBegin_freetid, | |
3087 | TxStat.txBeginAnon, | |
3088 | TxStat.txBeginAnon_barrier, | |
3089 | TxStat.txBeginAnon_lockslow, | |
3090 | TxStat.txLockAlloc, | |
3091 | TxStat.txLockAlloc_freelock); | |
3092 | ||
3093 | begin = offset; | |
3094 | *start = buffer + begin; | |
3095 | len -= begin; | |
3096 | ||
3097 | if (len > length) | |
3098 | len = length; | |
3099 | else | |
3100 | *eof = 1; | |
3101 | ||
3102 | if (len < 0) | |
3103 | len = 0; | |
3104 | ||
3105 | return len; | |
3106 | } | |
3107 | #endif |