Lines Matching defs:dir
70 } dir[2];
491 dir[TT.dir_num].list = xrealloc(dir[TT.dir_num].list,
495 dir[TT.dir_num].list[TT.size - 1] = full_path;
738 path[0] = concat_file_path(dir[0].list[0], dir[1].list[r] + TT.len[1]);
740 path[1] = f[1] = dir[1].list[r];
745 path[1] = concat_file_path(dir[1].list[0], dir[0].list[l] + TT.len[0]);
747 path[0] = f[0] = dir[0].list[l];
754 path[i] = f[i] = dir[i].list[!i ? l: r];
793 while (l < dir[0].nr_elm && r < dir[1].nr_elm) {
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]);
798 free(dir[1].list[r]);
801 printf ("Only in %s: %s\n", dir[0].list[0], dir[0].list[l] + TT.len[0]);
802 free(dir[0].list[l]);
809 free(dir[1].list[r]);
812 free(dir[0].list[l]);
815 free(dir[1].list[r]);
816 free(dir[0].list[l]);
823 if (l == dir[0].nr_elm) {
824 while (r < dir[1].nr_elm) {
826 printf ("Only in %s: %s\n", dir[1].list[0], dir[1].list[r] + TT.len[1]);
829 free(dir[1].list[r]);
832 } else if (r == dir[1].nr_elm) {
833 while (l < dir[0].nr_elm) {
835 printf ("Only in %s: %s\n", dir[0].list[0], dir[0].list[l] + TT.len[0]);
838 free(dir[0].list[l]);
842 free(dir[0].list[0]); //we are done, free root nodes too
843 free(dir[1].list[0]);
877 memset(&dir[j], 0, sizeof(struct dir_t));
879 dir[j].nr_elm = TT.size; //size updated in list_dir
880 qsort(&(dir[j].list[1]), (TT.size - 1), sizeof(char*), cmp);
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] != '/');
886 while (k < TT.size && strcmp(dir[j].list[k] +
897 free(dir[0].list); //free array
898 free(dir[1].list);