2 * Copyright (C) 2005 Junio C Hamano
3 * Copyright (C) 2010 Google Inc.
8 #include "xdiff-interface.h"
16 static void diffgrep_consume(void *priv
, char *line
, unsigned long len
)
18 struct diffgrep_cb
*data
= priv
;
22 if (line
[0] != '+' && line
[0] != '-')
26 * NEEDSWORK: we should have a way to terminate the
30 /* Yuck -- line ought to be "const char *"! */
33 data
->hit
= !regexec(data
->regexp
, line
+ 1, 1, ®match
, 0);
37 static void fill_one(struct diff_filespec
*one
,
38 mmfile_t
*mf
, struct userdiff_driver
**textconv
)
40 if (DIFF_FILE_VALID(one
)) {
41 *textconv
= get_textconv(one
);
42 mf
->size
= fill_textconv(*textconv
, one
, &mf
->ptr
);
44 memset(mf
, 0, sizeof(*mf
));
48 static int diff_grep(struct diff_filepair
*p
, regex_t
*regexp
, struct diff_options
*o
)
51 struct userdiff_driver
*textconv_one
= NULL
;
52 struct userdiff_driver
*textconv_two
= NULL
;
56 if (diff_unmodified_pair(p
))
59 fill_one(p
->one
, &mf1
, &textconv_one
);
60 fill_one(p
->two
, &mf2
, &textconv_two
);
64 return 0; /* ignore unmerged */
65 /* created "two" -- does it have what we are looking for? */
66 hit
= !regexec(regexp
, p
->two
->data
, 1, ®match
, 0);
67 } else if (!mf2
.ptr
) {
68 /* removed "one" -- did it have what we are looking for? */
69 hit
= !regexec(regexp
, p
->one
->data
, 1, ®match
, 0);
72 * We have both sides; need to run textual diff and see if
73 * the pattern appears on added/deleted lines.
75 struct diffgrep_cb ecbdata
;
79 memset(&xpp
, 0, sizeof(xpp
));
80 memset(&xecfg
, 0, sizeof(xecfg
));
81 ecbdata
.regexp
= regexp
;
83 xecfg
.ctxlen
= o
->context
;
84 xecfg
.interhunkctxlen
= o
->interhunkcontext
;
85 xdi_diff_outf(&mf1
, &mf2
, diffgrep_consume
, &ecbdata
,
96 static void diffcore_pickaxe_grep(struct diff_options
*o
)
98 struct diff_queue_struct
*q
= &diff_queued_diff
;
101 struct diff_queue_struct outq
;
103 outq
.nr
= outq
.alloc
= 0;
105 err
= regcomp(®ex
, o
->pickaxe
, REG_EXTENDED
| REG_NEWLINE
);
108 regerror(err
, ®ex
, errbuf
, 1024);
110 die("invalid log-grep regex: %s", errbuf
);
113 if (o
->pickaxe_opts
& DIFF_PICKAXE_ALL
) {
114 /* Showing the whole changeset if needle exists */
115 for (i
= 0; i
< q
->nr
; i
++) {
116 struct diff_filepair
*p
= q
->queue
[i
];
117 if (diff_grep(p
, ®ex
, o
))
118 goto out
; /* do not munge the queue */
122 * Otherwise we will clear the whole queue by copying
123 * the empty outq at the end of this function, but
124 * first clear the current entries in the queue.
126 for (i
= 0; i
< q
->nr
; i
++)
127 diff_free_filepair(q
->queue
[i
]);
129 /* Showing only the filepairs that has the needle */
130 for (i
= 0; i
< q
->nr
; i
++) {
131 struct diff_filepair
*p
= q
->queue
[i
];
132 if (diff_grep(p
, ®ex
, o
))
135 diff_free_filepair(p
);
147 static unsigned int contains(struct diff_filespec
*one
,
148 const char *needle
, unsigned long len
,
149 regex_t
*regexp
, kwset_t kws
)
156 if (diff_populate_filespec(one
, 0))
167 assert(data
[sz
] == '\0');
168 while (*data
&& !regexec(regexp
, data
, 1, ®match
, flags
)) {
170 data
+= regmatch
.rm_eo
;
171 if (*data
&& regmatch
.rm_so
== regmatch
.rm_eo
)
176 } else { /* Classic exact string match */
178 size_t offset
= kwsexec(kws
, data
, sz
, NULL
);
183 found
= data
+ offset
;
184 sz
-= found
- data
+ len
;
189 diff_free_filespec_data(one
);
193 static void diffcore_pickaxe_count(struct diff_options
*o
)
195 const char *needle
= o
->pickaxe
;
196 int opts
= o
->pickaxe_opts
;
197 struct diff_queue_struct
*q
= &diff_queued_diff
;
198 unsigned long len
= strlen(needle
);
200 regex_t regex
, *regexp
= NULL
;
202 struct diff_queue_struct outq
;
203 DIFF_QUEUE_CLEAR(&outq
);
205 if (opts
& DIFF_PICKAXE_REGEX
) {
207 err
= regcomp(®ex
, needle
, REG_EXTENDED
| REG_NEWLINE
);
209 /* The POSIX.2 people are surely sick */
211 regerror(err
, ®ex
, errbuf
, 1024);
213 die("invalid pickaxe regex: %s", errbuf
);
217 kws
= kwsalloc(NULL
);
218 kwsincr(kws
, needle
, len
);
222 if (opts
& DIFF_PICKAXE_ALL
) {
223 /* Showing the whole changeset if needle exists */
224 for (i
= 0; i
< q
->nr
; i
++) {
225 struct diff_filepair
*p
= q
->queue
[i
];
226 if (!DIFF_FILE_VALID(p
->one
)) {
227 if (!DIFF_FILE_VALID(p
->two
))
228 continue; /* ignore unmerged */
230 if (contains(p
->two
, needle
, len
, regexp
, kws
))
233 else if (!DIFF_FILE_VALID(p
->two
)) {
234 if (contains(p
->one
, needle
, len
, regexp
, kws
))
237 else if (!diff_unmodified_pair(p
) &&
238 contains(p
->one
, needle
, len
, regexp
, kws
) !=
239 contains(p
->two
, needle
, len
, regexp
, kws
))
242 goto out
; /* do not munge the queue */
245 /* otherwise we will clear the whole queue
246 * by copying the empty outq at the end of this
247 * function, but first clear the current entries
250 for (i
= 0; i
< q
->nr
; i
++)
251 diff_free_filepair(q
->queue
[i
]);
254 /* Showing only the filepairs that has the needle */
255 for (i
= 0; i
< q
->nr
; i
++) {
256 struct diff_filepair
*p
= q
->queue
[i
];
258 if (!DIFF_FILE_VALID(p
->one
)) {
259 if (!DIFF_FILE_VALID(p
->two
))
260 ; /* ignore unmerged */
262 else if (contains(p
->two
, needle
, len
, regexp
,
266 else if (!DIFF_FILE_VALID(p
->two
)) {
267 if (contains(p
->one
, needle
, len
, regexp
, kws
))
270 else if (!diff_unmodified_pair(p
) &&
271 contains(p
->one
, needle
, len
, regexp
, kws
) !=
272 contains(p
->two
, needle
, len
, regexp
, kws
))
278 diff_free_filepair(p
);
285 if (opts
& DIFF_PICKAXE_REGEX
)
292 void diffcore_pickaxe(struct diff_options
*o
)
294 /* Might want to warn when both S and G are on; I don't care... */
295 if (o
->pickaxe_opts
& DIFF_PICKAXE_KIND_G
)
296 diffcore_pickaxe_grep(o
);
298 diffcore_pickaxe_count(o
);