Lines Matching defs:length
461 int length, i;
469 length = strlen(pattern);
470 if (length < 1) {
477 length++;
480 result = malloc(length + 3);
1079 int length;
1096 length = *((char*)mft + off_name);
1100 && (length > 0)
1101 && ((off_name + 2*length + 2)
1109 name->uname_len = length;
1111 if (ntfs_ucstombs(name->uname, length,
1493 if (rl[0].length <= 0) {
1501 "clusters\n", (long long)rl[0].length);
1502 clusters_inuse += rl[0].length;
1506 for (i = 0; rl[i].length > 0; i++) {
1510 (long long)rl[i].length);
1511 clusters_inuse += rl[i].length;
1516 clusters_free += rl[i].length;
1521 end = rl[i].lcn + rl[i].length;
1647 if ((!d->runlist) || (d->runlist[0].length <= 0)) {
1650 for (i = 0; d->runlist[i].length > 0; i++) {
1652 (long long)d->runlist[i].length,
2073 if (rl[0].length <= 0) {
2088 (long long)rl[0].length);
2090 for (k = 0; k < rl[0].length * vol->cluster_size; k += bufsize) {
2100 for (i = 0; rl[i].length > 0; i++) {
2105 (long long)rl[i].length);
2107 for (k = 0; k < rl[i].length * vol->cluster_size; k += bufsize) {
2121 for (k = 0; k < rl[i].length * vol->cluster_size; k += bufsize) {
2132 end = rl[i].lcn + rl[i].length;
2171 * already recovers their exact length. +mabs