dtlck             819 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck             877 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck             878 fs/jfs/jfs_dtree.c 	ASSERT(dtlck->index == 0);
dtlck             879 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck             884 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck             886 fs/jfs/jfs_dtree.c 	dtInsertEntry(p, index, name, &data, &dtlck);
dtlck             890 fs/jfs/jfs_dtree.c 		if (dtlck->index >= dtlck->maxcnt)
dtlck             891 fs/jfs/jfs_dtree.c 			dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck             892 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[dtlck->index];
dtlck             897 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck             939 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            1254 fs/jfs/jfs_dtree.c 			dtlck = (struct dt_lock *) & tlck->lock;
dtlck            1255 fs/jfs/jfs_dtree.c 			ASSERT(dtlck->index == 0);
dtlck            1256 fs/jfs/jfs_dtree.c 			lv = & dtlck->lv[0];
dtlck            1261 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            1271 fs/jfs/jfs_dtree.c 				dtlck->index++;
dtlck            1274 fs/jfs/jfs_dtree.c 			dtInsertEntry(sp, skip, &key, data, &dtlck);
dtlck            1341 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            1476 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            1479 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[dtlck->index];
dtlck            1482 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            1646 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            1722 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            1723 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck            1747 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            1762 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            1809 fs/jfs/jfs_dtree.c 	dtInsertEntry(sp, split->index, split->key, split->data, &dtlck);
dtlck            1818 fs/jfs/jfs_dtree.c 			dtLinelockFreelist(sp, n, &dtlck);
dtlck            1828 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            1829 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[dtlck->index];
dtlck            1834 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            1881 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            1920 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            1934 fs/jfs/jfs_dtree.c 	ASSERT(dtlck->index == 0);
dtlck            1935 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck            1938 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            2001 fs/jfs/jfs_dtree.c 	dtInsertEntry(rp, split->index, split->key, split->data, &dtlck);
dtlck            2017 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2020 fs/jfs/jfs_dtree.c 	ASSERT(dtlck->index == 0);
dtlck            2021 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck            2024 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            2079 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            2157 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2166 fs/jfs/jfs_dtree.c 		if (dtlck->index >= dtlck->maxcnt)
dtlck            2167 fs/jfs/jfs_dtree.c 			dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2168 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[dtlck->index];
dtlck            2171 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            2175 fs/jfs/jfs_dtree.c 			if (dtlck->index >= dtlck->maxcnt)
dtlck            2176 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2177 fs/jfs/jfs_dtree.c 			lv = & dtlck->lv[dtlck->index];
dtlck            2183 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            2187 fs/jfs/jfs_dtree.c 		dtDeleteEntry(p, index, &dtlck);
dtlck            2234 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            2379 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2382 fs/jfs/jfs_dtree.c 		if (dtlck->index >= dtlck->maxcnt)
dtlck            2383 fs/jfs/jfs_dtree.c 			dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2384 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[dtlck->index];
dtlck            2387 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            2391 fs/jfs/jfs_dtree.c 			if (dtlck->index < dtlck->maxcnt)
dtlck            2394 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2395 fs/jfs/jfs_dtree.c 				lv = & dtlck->lv[0];
dtlck            2402 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            2406 fs/jfs/jfs_dtree.c 		dtDeleteEntry(p, index, &dtlck);
dtlck            2411 fs/jfs/jfs_dtree.c 			dtTruncateEntry(p, 0, &dtlck);
dtlck            2446 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            2515 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2517 fs/jfs/jfs_dtree.c 		ASSERT(dtlck->index == 0);
dtlck            2518 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[0];
dtlck            2521 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            2529 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2531 fs/jfs/jfs_dtree.c 		ASSERT(dtlck->index == 0);
dtlck            2532 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[0];
dtlck            2535 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            2551 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2553 fs/jfs/jfs_dtree.c 	ASSERT(dtlck->index == 0);
dtlck            2554 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck            2565 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            2602 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2603 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[dtlck->index];
dtlck            2611 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            2741 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            2762 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2765 fs/jfs/jfs_dtree.c 		if (dtlck->index >= dtlck->maxcnt)
dtlck            2766 fs/jfs/jfs_dtree.c 			dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2767 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[dtlck->index];
dtlck            2770 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            2791 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2794 fs/jfs/jfs_dtree.c 		if (dtlck->index >= dtlck->maxcnt)
dtlck            2795 fs/jfs/jfs_dtree.c 			dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2796 fs/jfs/jfs_dtree.c 		lv = & dtlck->lv[dtlck->index];
dtlck            2799 fs/jfs/jfs_dtree.c 		dtlck->index++;
dtlck            2821 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            2866 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            2869 fs/jfs/jfs_dtree.c 	ASSERT(dtlck->index == 0);
dtlck            2870 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck            2873 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            2909 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            2936 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) &tlck->lock;
dtlck            2944 fs/jfs/jfs_dtree.c 			if (dtlck->index >= dtlck->maxcnt)
dtlck            2945 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            2946 fs/jfs/jfs_dtree.c 			lv = &dtlck->lv[dtlck->index];
dtlck            2949 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            3904 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck = *dtlock;
dtlck            3920 fs/jfs/jfs_dtree.c 	if (dtlck->index >= dtlck->maxcnt)
dtlck            3921 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            3923 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[dtlck->index];
dtlck            3971 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            3974 fs/jfs/jfs_dtree.c 			if (dtlck->index < dtlck->maxcnt)
dtlck            3977 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            3978 fs/jfs/jfs_dtree.c 				lv = & dtlck->lv[0];
dtlck            3996 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            3998 fs/jfs/jfs_dtree.c 	*dtlock = dtlck;
dtlck            4258 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck = *dtlock;
dtlck            4267 fs/jfs/jfs_dtree.c 	if (dtlck->index >= dtlck->maxcnt)
dtlck            4268 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            4269 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[dtlck->index];
dtlck            4291 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            4294 fs/jfs/jfs_dtree.c 			if (dtlck->index < dtlck->maxcnt)
dtlck            4297 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            4298 fs/jfs/jfs_dtree.c 				lv = & dtlck->lv[0];
dtlck            4316 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            4318 fs/jfs/jfs_dtree.c 	*dtlock = dtlck;
dtlck            4353 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck = *dtlock;
dtlck            4362 fs/jfs/jfs_dtree.c 	if (dtlck->index >= dtlck->maxcnt)
dtlck            4363 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            4364 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[dtlck->index];
dtlck            4386 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            4389 fs/jfs/jfs_dtree.c 			if (dtlck->index < dtlck->maxcnt)
dtlck            4392 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            4393 fs/jfs/jfs_dtree.c 				lv = & dtlck->lv[0];
dtlck            4411 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            4413 fs/jfs/jfs_dtree.c 	*dtlock = dtlck;
dtlck            4434 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck = *dtlock;
dtlck            4442 fs/jfs/jfs_dtree.c 	if (dtlck->index >= dtlck->maxcnt)
dtlck            4443 fs/jfs/jfs_dtree.c 		dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            4444 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[dtlck->index];
dtlck            4460 fs/jfs/jfs_dtree.c 			dtlck->index++;
dtlck            4463 fs/jfs/jfs_dtree.c 			if (dtlck->index < dtlck->maxcnt)
dtlck            4466 fs/jfs/jfs_dtree.c 				dtlck = (struct dt_lock *) txLinelock(dtlck);
dtlck            4467 fs/jfs/jfs_dtree.c 				lv = & dtlck->lv[0];
dtlck            4483 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            4485 fs/jfs/jfs_dtree.c 	*dtlock = dtlck;
dtlck            4517 fs/jfs/jfs_dtree.c 	struct dt_lock *dtlck;
dtlck            4539 fs/jfs/jfs_dtree.c 	dtlck = (struct dt_lock *) & tlck->lock;
dtlck            4546 fs/jfs/jfs_dtree.c 	ASSERT(dtlck->index == 0);
dtlck            4547 fs/jfs/jfs_dtree.c 	lv = & dtlck->lv[0];
dtlck            4550 fs/jfs/jfs_dtree.c 	dtlck->index++;
dtlck            1074 fs/jfs/namei.c 	struct dt_lock *dtlck;
dtlck            1253 fs/jfs/namei.c 			dtlck = (struct dt_lock *) & tlck->lock;
dtlck            1254 fs/jfs/namei.c 			ASSERT(dtlck->index == 0);
dtlck            1255 fs/jfs/namei.c 			lv = & dtlck->lv[0];
dtlck            1258 fs/jfs/namei.c 			dtlck->index++;