Searched defs:runs (Results 1 - 5 of 5) sorted by relevance
/osnet-11/usr/src/cmd/ntfsprogs/ |
H A D | cluster.c | 51 runlist *runs; local 76 runs = ntfs_mapping_pairs_decompress(vol, a_ctx->attr, NULL); 77 if (!runs) { 78 ntfs_log_error("Couldn't read the data runs.\n"); 85 for (j = 0; runs[j].length > 0; j++) { 86 LCN a_begin = runs[j].lcn; 87 LCN a_end = a_begin + runs[j].length - 1; 93 (long long)runs[j].vcn, 94 (long long)runs[j].lcn, 95 (long long)(runs[ [all...] |
H A D | ntfscluster.c | 393 runlist *runs; local 405 runs = ntfs_mapping_pairs_decompress(vol, rec, NULL); 406 if (runs) { 408 for (i = 0; runs[i].length > 0; i++) { 410 (long long)runs[i].vcn, 411 (long long)runs[i].lcn, 413 runs[i].length); 415 free(runs);
|
H A D | ntfsresize.c | 856 * data runs will be marked in lcn_bitmap. 1313 int rl_size, runs = 0; local 1323 if (runs) 1329 rl_size = (runs + 2) * sizeof(runlist_element); 1333 rl_set(rl + runs, vcn, rle.lcn, rle.length); 1337 runs++; 1340 rl_set(rl + runs, vcn, -1LL, 0LL); 1342 if (runs > 1) {
|
/osnet-11/usr/src/lib/libwrap/ |
H A D | misc.c | 80 int runs = 0; local 83 /* Count the number of runs of non-dot characters. */ 90 runs++; 94 return (runs == 4 ? inet_addr(str) : INADDR_NONE);
|
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ |
H A D | pp_sort.c | 69 ** initialize looking for natural runs, we'll always produce stable 133 ** The array of elements at list1 will be organized into runs of length 2, 134 ** or runs of length >= 2 * PTHRESH. We only try to form long runs when 142 ** p2 parallels b in the list2 array, where runs are defined by 187 IV runs = 0; local 200 /* Having laid out the playing field, look for long runs */ 225 p2 = NEXT(p2) = p2 + (p - b); ++runs; 234 p2 = NEXT(p2) = p2 + 2; ++runs; 242 NEXT(p2) = p2 + 1; ++runs; 335 IV runs; /* how many runs must be combined into 1 */ member in struct:__anon102 341 IV i, run, runs, offset; local [all...] |
Completed in 52 milliseconds