101 static int dbFindBits(u32 word, int l2nb);
112 static int cnttz(u32 word);
428 	int word, nbits, nwords;  in dbUpdatePMap()  local
478 		word = dbitno >> L2DBWORD;  in dbUpdatePMap()
504 					dp->pmap[word] &=  in dbUpdatePMap()
507 					dp->pmap[word] |=  in dbUpdatePMap()
510 				word += 1;  in dbUpdatePMap()
523 					memset(&dp->pmap[word], 0,  in dbUpdatePMap()
526 					memset(&dp->pmap[word], (int) ONES,  in dbUpdatePMap()
529 				word += nwords;  in dbUpdatePMap()
1128 	int dbitno, word, rembits, nb, nwords, wbitno, nw;  in dbAllocNext()  local
1146 	word = dbitno >> L2DBWORD;  in dbAllocNext()
1157 	if (leaf[word] == NOFREE)  in dbAllocNext()
1186 			if ((mask & ~le32_to_cpu(dp->wmap[word])) != mask)  in dbAllocNext()
1189 			word += 1;  in dbAllocNext()
1204 				if (leaf[word] < BUDMIN)  in dbAllocNext()
1211 				    min_t(int, leaf[word], NLSTOL2BSZ(nwords));  in dbAllocNext()
1218 				word += nw;  in dbAllocNext()
1260 	int word, lword, rc;  in dbAllocNear()  local
1274 	word = (blkno & (BPERDMAP - 1)) >> L2DBWORD;  in dbAllocNear()
1275 	lword = min(word + 4, LPERDMAP);  in dbAllocNear()
1279 	for (; word < lword; word++) {  in dbAllocNear()
1282 		if (leaf[word] < l2nb)  in dbAllocNear()
1288 		blkno = le64_to_cpu(dp->start) + (word << L2DBWORD);  in dbAllocNear()
1295 		if (leaf[word] < BUDMIN)  in dbAllocNear()
1297 			    dbFindBits(le32_to_cpu(dp->wmap[word]), l2nb);  in dbAllocNear()
2119 	int rc = 0, word;  in dbFreeDmap()  local
2138 		word = (blkno & (BPERDMAP - 1)) >> L2DBWORD;  in dbFreeDmap()
2145 		if (dp->tree.stree[word] == NOFREE)  in dbFreeDmap()
2146 			dbBackSplit((dmtree_t *) & dp->tree, word);  in dbFreeDmap()
2180 	int dbitno, word, rembits, nb, nwords, wbitno, nw, agno;  in dbAllocBits()  local
2192 	word = dbitno >> L2DBWORD;  in dbAllocBits()
2223 			dp->wmap[word] |= cpu_to_le32(ONES << (DBWORD - nb)  in dbAllocBits()
2231 			dbSplit(tp, word, BUDMIN,  in dbAllocBits()
2232 				dbMaxBud((u8 *) & dp->wmap[word]));  in dbAllocBits()
2234 			word += 1;  in dbAllocBits()
2242 			memset(&dp->wmap[word], (int) ONES, nwords * 4);  in dbAllocBits()
2252 				if (leaf[word] < BUDMIN) {  in dbAllocBits()
2263 				size = min_t(int, leaf[word],  in dbAllocBits()
2272 				dbSplit(tp, word, size, NOFREE);  in dbAllocBits()
2276 				word += nw;  in dbAllocBits()
2327 	int dbitno, word, rembits, nb, nwords, wbitno, nw, agno;  in dbFreeBits()  local
2336 	word = dbitno >> L2DBWORD;  in dbFreeBits()
2372 			dp->wmap[word] &=  in dbFreeBits()
2378 			rc = dbJoin(tp, word,  in dbFreeBits()
2379 				    dbMaxBud((u8 *) & dp->wmap[word]));  in dbFreeBits()
2383 			word += 1;  in dbFreeBits()
2390 			memset(&dp->wmap[word], 0, nwords * 4);  in dbFreeBits()
2407 					(word, L2LPERDMAP, BUDMIN),  in dbFreeBits()
2412 				rc = dbJoin(tp, word, size);  in dbFreeBits()
2419 				word += nw;  in dbFreeBits()
3030 static int dbFindBits(u32 word, int l2nb)  in dbFindBits()  argument
3043 	word = ~word;  in dbFindBits()
3049 		if ((mask & word) == mask)  in dbFindBits()
3110 static int cnttz(u32 word)  in cnttz()  argument
3114 	for (n = 0; n < 32; n++, word >>= 1) {  in cnttz()
3115 		if (word & 0x01)  in cnttz()
3267 	int dbitno, word, rembits, nb, nwords, wbitno, agno;  in dbAllocDmapBU()  local
3280 	word = dbitno >> L2DBWORD;  in dbAllocDmapBU()
3311 			dp->wmap[word] |= cpu_to_le32(ONES << (DBWORD - nb)  in dbAllocDmapBU()
3314 			word++;  in dbAllocDmapBU()
3322 			memset(&dp->wmap[word], (int) ONES, nwords * 4);  in dbAllocDmapBU()
3326 			word += nwords;  in dbAllocDmapBU()