Lines Matching refs:word
99 static int dbFindBits(u32 word, int l2nb);
111 static int cnttz(u32 word);
422 int word, nbits, nwords;
468 /* determine the bit number and word within the dmap of
473 word = dbitno >> L2DBWORD;
478 * this is the case, we'll work against that word (i.e.
485 /* determine the bit number within the word and
486 * the number of bits within the word.
491 /* check if only part of the word is to be updated. */
494 * in this word.
499 dp->pmap[word] &=
502 dp->pmap[word] |=
505 word += 1;
518 memset(&dp->pmap[word], 0,
521 memset(&dp->pmap[word], (int) ONES,
524 word += nwords;
1125 int dbitno, word, rembits, nb, nwords, wbitno, nw;
1140 /* determine the bit number and word within the dmap of the
1144 word = dbitno >> L2DBWORD;
1155 if (leaf[word] == NOFREE)
1172 /* determine the bit number within the word and
1173 * the number of bits within the word.
1178 /* check if only part of the word is to be examined.
1184 if ((mask & ~le32_to_cpu(dp->wmap[word])) != mask)
1187 word += 1;
1202 if (leaf[word] < BUDMIN)
1209 min((int)leaf[word], NLSTOL2BSZ(nwords));
1216 word += nw;
1258 int word, lword, rc;
1269 /* determine the word within the dmap that holds the hint
1270 * (i.e. blkno). also, determine the last word in the dmap
1273 word = (blkno & (BPERDMAP - 1)) >> L2DBWORD;
1274 lword = min(word + 4, LPERDMAP);
1278 for (; word < lword; word++) {
1281 if (leaf[word] < l2nb)
1285 * of the first block described by this dmap word.
1287 blkno = le64_to_cpu(dp->start) + (word << L2DBWORD);
1289 /* if not all bits of the dmap word are free, get the
1290 * starting bit number within the dmap word of the required
1294 if (leaf[word] < BUDMIN)
1296 dbFindBits(le32_to_cpu(dp->wmap[word]), l2nb);
1912 /* if not all bits of the dmap word are free, get the starting
1913 * bit number within the dmap word of the required string of free
2013 int rc = 0, word;
2032 word = (blkno & (BPERDMAP - 1)) >> L2DBWORD;
2039 if (dp->tree.stree[word] == NOFREE)
2040 dbBackSplit((dmtree_t *) & dp->tree, word);
2074 int dbitno, word, rembits, nb, nwords, wbitno, nw, agno;
2082 /* determine the bit number and word within the dmap of the
2086 word = dbitno >> L2DBWORD;
2096 * updating the leaf corresponding to the dmap word. a single pass
2105 /* determine the bit number within the word and
2106 * the number of bits within the word.
2111 /* check if only part of a word is to be allocated.
2115 * this dmap word.
2117 dp->wmap[word] |= cpu_to_le32(ONES << (DBWORD - nb)
2120 /* update the leaf for this dmap word. in addition
2122 * of the updated dmap word, dbSplit() will split
2125 dbSplit(tp, word, BUDMIN,
2126 dbMaxBud((u8 *) & dp->wmap[word]));
2128 word += 1;
2136 memset(&dp->wmap[word], (int) ONES, nwords * 4);
2146 if (leaf[word] < BUDMIN) {
2158 size = min((int)leaf[word], NLSTOL2BSZ(nwords));
2166 dbSplit(tp, word, size, NOFREE);
2170 word += nw;
2221 int dbitno, word, rembits, nb, nwords, wbitno, nw, agno;
2226 /* determine the bit number and word within the dmap of the
2230 word = dbitno >> L2DBWORD;
2241 * the leaf corresponding to the dmap word. a single pass will be used
2254 /* determine the bit number within the word and
2255 * the number of bits within the word.
2260 /* check if only part of a word is to be freed.
2264 * dmap word.
2266 dp->wmap[word] &=
2270 /* update the leaf for this dmap word.
2272 rc = dbJoin(tp, word,
2273 dbMaxBud((u8 *) & dp->wmap[word]));
2277 word += 1;
2284 memset(&dp->wmap[word], 0, nwords * 4);
2301 (word, L2LPERDMAP, BUDMIN),
2306 rc = dbJoin(tp, word, size);
2313 word += nw;
2914 * dmap bitmap word value.
2920 * word - dmap bitmap word value.
2926 static int dbFindBits(u32 word, int l2nb)
2936 /* complement the word so we can use a mask (i.e. 0s represent
2939 word = ~word;
2942 /* scan the word for nb free bits at nb alignments.
2945 if ((mask & word) == mask)
2967 * largest binary buddy of free bits within a dmap word.
2973 /* check if the wmap word is all free. if so, the
2979 /* check if the wmap word is half free. if so, the
2986 * size thru table lookup using quarters of the wmap word.
2995 * NAME: cnttz(uint word)
3006 static int cnttz(u32 word)
3010 for (n = 0; n < 32; n++, word >>= 1) {
3011 if (word & 0x01)
3163 int dbitno, word, rembits, nb, nwords, wbitno, agno;
3175 /* determine the bit number and word within the dmap of the
3179 word = dbitno >> L2DBWORD;
3189 * updating the leaf corresponding to the dmap word. a single pass
3198 /* determine the bit number within the word and
3199 * the number of bits within the word.
3204 /* check if only part of a word is to be allocated.
3208 * this dmap word.
3210 dp->wmap[word] |= cpu_to_le32(ONES << (DBWORD - nb)
3213 word++;
3221 memset(&dp->wmap[word], (int) ONES, nwords * 4);
3225 word += nwords;
3668 /* word number containing start block number */
3677 /* number of bits preceding range to be freed in the word */
3679 /* number of bits to free in the word */
3682 /* is partial word to be freed ? */
3684 /* free (set to 0) from the bitmap word */
3690 /* skip the word freed */
3712 /* the first word beyond the end of existing blocks */
3718 /* mark a partial word allocated */
3763 /* init each leaf from corresponding wmap word:
3765 * bitmap word are allocated.
3782 * from corresponding bitmap word or root of summary tree