Lines Matching defs:length
74 /* Match length at or above which ntfs_best_match() will stop searching for
131 * This function sets pctx->size and pctx->rel to the length and offset,
134 * The minimum match length is assumed to be 3, and the maximum match
135 * length is assumed to be pctx->mxsz. If this function produces
174 /* Lazy match is being attempted, but there aren't enough length
325 * first adjust the maximum match length if needed.
370 * adjusted the maximum match length at the
394 /* The minimum match length is 3, and
536 /* Check if the decompressed sub-block was not full-length. */
555 u16 lg, pt, length, max_non_overlap;
598 /* Now calculate the length of the byte sequence. */
599 length = (pt & (0xfff >> lg)) + 3;
601 if (dest + length > dest_sb_end)
605 if (length <= max_non_overlap) {
607 memcpy(dest, dest_back_addr, length);
609 dest += length;
620 length -= max_non_overlap;
621 while (length--)
659 cb_clusters -= rl->length - (cb_start_vcn - rl->vcn);
664 if (rl->lcn < LCN_HOLE || !rl->length) {
667 if (!rl || rl->lcn < LCN_HOLE || !rl->length)
680 if (rl->length >= cb_clusters)
682 cb_clusters -= rl->length;
997 count = xrl->length << vol->cluster_size_bits;
1038 count = xrl->length << vol->cluster_size_bits;
1179 while (xrl->length) {
1180 if ((xrl->vcn + xrl->length) != xrl[1].vcn)
1183 if ((xrl->vcn + xrl->length)
1250 freelength = rl->length - usedcnt;
1258 oldlength = rl->length;
1263 rl->length -= freelength; /* warning : can be zero */
1285 freerl->length += (threeparts
1291 while (!res && frl->length && (freed < freecnt)) {
1292 if (frl->length <= (freecnt - freed)) {
1294 frl->length);
1296 freed += frl->length;
1298 frl->length += carry;
1308 frl->length -= freecnt - freed;
1322 while (erl->length)
1328 freerl[1].length = freelength - freecnt;
1329 freerl->length = freecnt;
1334 + freerl[1].length;
1338 freerl->length += freelength;
1342 while (erl->length)
1350 freerl[1].length = oldlength - usedcnt - freecnt;
1358 freerl->length = freecnt;
1364 freerl->length = freecnt;
1366 freerl->length += freerl[1].length;
1371 } while (erl->length);
1378 freerl->length = freecnt;
1380 freerl->length += freerl[holes].length;
1387 } while (erl->length);
1399 while (!res && frl->length && (freed < freecnt)) {
1400 if (frl->length <= (freecnt - freed)) {
1401 freerl->length += frl->length;
1402 freed += frl->length;
1404 frl->length);
1407 freerl->length += freecnt - freed;
1412 frl->length -= freecnt - freed;
1419 if (frl->length && (frl->lcn == LCN_HOLE)) {
1420 xrl->length += frl->length;
1423 while (frl->length) {
1466 while (rl->length && (rl->length < usedcnt)) {
1467 usedcnt -= rl->length; /* must be > 0 */
1470 if (rl->length) {
1487 freelength = rl->length - usedcnt;
1498 while (freerl->length < carry) {
1499 carry -= freerl->length;
1502 freerl->length = carry;
1505 rl->length = usedcnt; /* can be zero ? */
1518 while (rl->length)
1523 rl[1].length = 0;
1527 rl->length = freelength;
1534 freerl->length = freelength;
1548 freerl->length += freecnt;
1555 freerl->length = freecnt;
1562 freerl[1].length = 0;
1767 offs += brl->length << vol->cluster_size_bits;
1847 > ((wrl->lcn + wrl->length)