Lines Matching defs:length
298 int length, i, j;
303 length = strlen(pattern);
304 if (length < 1) {
311 length++;
314 result = malloc(length + 3);
1211 if (rl[0].length <= 0) {
1219 "clusters\n", (long long)rl[0].length);
1220 clusters_inuse += rl[0].length;
1224 for (i = 0; rl[i].length > 0; i++) {
1228 (long long)rl[i].length);
1229 clusters_inuse += rl[i].length;
1234 clusters_free += rl[i].length;
1239 end = rl[i].lcn + rl[i].length;
1370 if ((!d->runlist) || (d->runlist[0].length <= 0)) {
1373 for (i = 0; d->runlist[i].length > 0; i++) {
1375 (long long)d->runlist[i].length,
1750 if (rl[0].length <= 0) {
1764 (long long)rl[0].length);
1766 for (k = 0; k < rl[0].length * vol->cluster_size; k += bufsize) {
1776 for (i = 0; rl[i].length > 0; i++) {
1781 (long long)rl[i].length);
1783 for (k = 0; k < rl[k].length * vol->cluster_size; k += bufsize) {
1797 for (k = 0; k < rl[k].length * vol->cluster_size; k += bufsize) {
1808 end = rl[i].lcn + rl[i].length;
1847 * already recovers their exact length. +mabs