Lines Matching defs:file
8 USE_DIFF(NEWTOY(diff, "<2>2(color)(strip-trailing-cr)B(ignore-blank-lines)d(minimal)b(ignore-space-change)ut(expand-tabs)w(ignore-all-space)i(ignore-case)T(initial-tab)s(report-identical-files)q(brief)a(text)L(label)*S(starting-file):N(new-file)r(recursive)U(unified)#<0=3", TOYFLAG_USR|TOYFLAG_BIN|TOYFLAG_ARGFAIL(2)))
80 } file[2];
249 /* file[0] corresponds file 1 and file[1] correspond file 2.
251 * 2. sort file[1] with hash as primary and serial as sec. key
252 * 3. Form the equivalance class of file[1] stored in e vector. It lists all the equivalence
253 * classes of lines in file[1], with e.last = true on the last element of each class.
256 * to the beginning of the equiv class of lines in file[1] equivalent to line
257 * i in file[0].
259 * 6. Create a vector J[i] = j, such that i'th line in file[0] is j'th line of
260 * file[1], i.e J comprises LCS
276 file[i].len = 0;
277 fseek(file[i].fp, 0, SEEK_SET);
280 tok = read_tok(file[i].fp, &off, tok);
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?
357 fseek(file[0].fp, TT.offset[0][i - 1], SEEK_SET);
358 fseek(file[1].fp, TT.offset[1][J[i] - 1], SEEK_SET);
360 for (j = J[i]; i <= file[0].len && J[i] == j; i++, j++) {
364 tok0 = read_tok(file[0].fp, NULL, tok0);
365 tok1 = read_tok(file[1].fp, NULL, tok1);
384 if (IS_STDIN(files[i])) file[i].fp = read_stdin();
385 else file[i].fp = fopen(files[i], "r");
387 if (!file[i].fp){
398 fseek(file[0].fp, 0, SEEK_SET);
399 fseek(file[1].fp, 0, SEEK_SET);
404 i = fread(bufi, 1, s, file[0].fp);
405 j = fread(bufj, 1, s, file[1].fp);
441 printf("%s\n\\ No newline at end of file\n", reset ? reset : "");
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);
699 if (t== ptr1) print_diff(t->suff, t->a-1, ' ', TT.offset[0], file[0].fp);
700 print_diff(t->a, t->b, '-', TT.offset[0], file[0].fp);
701 print_diff(t->c, t->d, '+', TT.offset[1], file[1].fp);
703 print_diff(t->b+1, (t)->prev, ' ', TT.offset[0], file[0].fp);
704 else print_diff(t->b+1, (t+1)->a-1, ' ', TT.offset[0], file[0].fp);
762 printf("File %s is not a regular file or directory "
765 printf("File %s is not a regular file or directory "
769 printf("File %s is a %s while file %s is a"
770 " %s\n", path[0], "directory", path[1], "regular file");
772 printf("File %s is a %s while file %s is a"
773 " %s\n", path[0], "regular file", path[1], "directory");
777 if (file[0].fp) fclose(file[0].fp);
778 if (file[1].fp) fclose(file[1].fp);
791 l = start[0]; //left side file start
792 r = start[1]; //right side file start
910 if (file[0].fp) fclose(file[0].fp);
911 if (file[1].fp) fclose(file[1].fp);