Lines Matching defs:len
45 int dir_num, size, is_binary, status, change, len[2];
79 int len;
276 file[i].len = 0;
286 if (size == ++file[i].len) {
292 v[i][file[i].len].hash = hash & INT_MAX;
293 TT.offset[i][file[i].len] = off;
295 TT.offset[i][file[i].len] = ++off;
301 if (TT.offset[i][file[i].len] - TT.offset[i][file[i].len - 1] == 1)
302 file[i].len--;
305 for (i = 0; i <= file[1].len; i++) v[1][i].serial = i;
306 qsort(v[1] + 1, file[1].len, sizeof(struct v_vector), comp);
311 for ( i = 1; i <= file[1].len; i++) {
312 if ((i == file[1].len) || (v[1][i].hash != v[1][i+1].hash)) e[i].last = 1;
316 p_vector = xzalloc((file[0].len + 2) * sizeof(int));
317 for (i = 1; i <= file[0].len; i++) {
318 void *r = bsearch(&v[0][i], (e + 1), file[1].len, sizeof(e[0]), bcomp);
322 for (i = 1; i <= file[0].len; i++)
330 kcand[1] = new_candidate(file[0].len+1, file[1].len+1, NULL); //the fence
333 for (i = 1; i <= file[0].len; i++) {
345 J = xzalloc((file[0].len + 2) * sizeof(int));
349 J[file[0].len + 1] = file[1].len+1; //mark boundary
354 for (i = 1; i <= file[0].len; i++) { // jackpot?
360 for (j = J[i]; i <= file[0].len && J[i] == j; i++, j++) {
471 int len = strlen(toys.optargs[TT.dir_num]), ret = 0;
476 ptr += len;
532 size_t len = 0;
541 len += 2;
544 len++;
547 len += 4;
549 len++;
554 result = xmalloc(len + (quote ? 2 : 0) + 1);
604 for (d[x].a = i; d[x].a <= file[0].len; d[x].a++) {
610 for (d[x].b = (d[x].a - 1); d[x].b <= file[0].len; d[x].b++) {
633 if (i > file[0].len) break;
636 } while (i <= file[0].len);
657 if (TT.ct > file[0].len) TT.ct = file[0].len; //trim context to file len.
666 b = MIN(file[0].len, b);
738 path[0] = concat_file_path(dir[0].list[0], dir[1].list[r] + TT.len[1]);
745 path[1] = concat_file_path(dir[1].list[0], dir[0].list[l] + TT.len[0]);
794 if ((j = strcmp ((dir[0].list[l] + TT.len[0]),
795 (dir[1].list[r] + TT.len[1]))) && !(toys.optflags & FLAG_N)) {
797 printf ("Only in %s: %s\n", dir[1].list[0], dir[1].list[r] + TT.len[1]);
801 printf ("Only in %s: %s\n", dir[0].list[0], dir[0].list[l] + TT.len[0]);
826 printf ("Only in %s: %s\n", dir[1].list[0], dir[1].list[r] + TT.len[1]);
835 printf ("Only in %s: %s\n", dir[0].list[0], dir[0].list[l] + TT.len[0]);
882 TT.len[j] = strlen(dir[j].list[0]); //calc root node len
883 TT.len[j] += (dir[j].list[0][TT.len[j] -1] != '/');
887 TT.len[j], TT.start) < 0) {