diffcore-pickaxe.c 3.28 KB
Newer Older
1 2 3 4 5 6 7
/*
 * Copyright (C) 2005 Junio C Hamano
 */
#include "cache.h"
#include "diff.h"
#include "diffcore.h"

8
static unsigned int contains(struct diff_filespec *one,
9 10
			     const char *needle, unsigned long len,
			     regex_t *regexp)
11
{
12
	unsigned int cnt;
13 14
	unsigned long offset, sz;
	const char *data;
15
	if (diff_populate_filespec(one, 0))
16
		return 0;
17 18
	if (!len)
		return 0;
19

20 21
	sz = one->size;
	data = one->data;
22 23
	cnt = 0;

24 25 26 27 28 29 30 31
	if (regexp) {
		regmatch_t regmatch;
		int flags = 0;

		while (*data && !regexec(regexp, data, 1, &regmatch, flags)) {
			flags |= REG_NOTBOL;
			data += regmatch.rm_so;
			if (*data) data++;
32 33
			cnt++;
		}
34 35 36 37 38 39 40 41 42 43 44 45

	} else { /* Classic exact string match */
		/* Yes, I've heard of strstr(), but the thing is *data may
		 * not be NUL terminated.  Sue me.
		 */
		for (offset = 0; offset + len <= sz; offset++) {
			/* we count non-overlapping occurrences of needle */
			if (!memcmp(needle, data + offset, len)) {
				offset += len - 1;
				cnt++;
			}
		}
46
	}
47
	diff_free_filespec_data(one);
48
	return cnt;
49 50
}

51
void diffcore_pickaxe(const char *needle, int opts)
52
{
53
	struct diff_queue_struct *q = &diff_queued_diff;
54
	unsigned long len = strlen(needle);
55
	int i, has_changes;
56
	regex_t regex, *regexp = NULL;
57 58 59 60
	struct diff_queue_struct outq;
	outq.queue = NULL;
	outq.nr = outq.alloc = 0;

61 62 63 64 65 66 67 68 69 70 71 72 73
	if (opts & DIFF_PICKAXE_REGEX) {
		int err;
		err = regcomp(&regex, needle, REG_EXTENDED | REG_NEWLINE);
		if (err) {
			/* The POSIX.2 people are surely sick */
			char errbuf[1024];
			regerror(err, &regex, errbuf, 1024);
			regfree(&regex);
			die("invalid pickaxe regex: %s", errbuf);
		}
		regexp = &regex;
	}

74 75 76 77 78 79 80 81
	if (opts & DIFF_PICKAXE_ALL) {
		/* Showing the whole changeset if needle exists */
		for (i = has_changes = 0; !has_changes && i < q->nr; i++) {
			struct diff_filepair *p = q->queue[i];
			if (!DIFF_FILE_VALID(p->one)) {
				if (!DIFF_FILE_VALID(p->two))
					continue; /* ignore unmerged */
				/* created */
82
				if (contains(p->two, needle, len, regexp))
83 84 85
					has_changes++;
			}
			else if (!DIFF_FILE_VALID(p->two)) {
86
				if (contains(p->one, needle, len, regexp))
87 88 89
					has_changes++;
			}
			else if (!diff_unmodified_pair(p) &&
90 91
				 contains(p->one, needle, len, regexp) !=
				 contains(p->two, needle, len, regexp))
92
				has_changes++;
93
		}
94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113
		if (has_changes)
			return; /* not munge the queue */

		/* otherwise we will clear the whole queue
		 * by copying the empty outq at the end of this
		 * function, but first clear the current entries
		 * in the queue.
		 */
		for (i = 0; i < q->nr; i++)
			diff_free_filepair(q->queue[i]);
	}
	else 
		/* Showing only the filepairs that has the needle */
		for (i = 0; i < q->nr; i++) {
			struct diff_filepair *p = q->queue[i];
			has_changes = 0;
			if (!DIFF_FILE_VALID(p->one)) {
				if (!DIFF_FILE_VALID(p->two))
					; /* ignore unmerged */
				/* created */
114
				else if (contains(p->two, needle, len, regexp))
115 116 117
					has_changes = 1;
			}
			else if (!DIFF_FILE_VALID(p->two)) {
118
				if (contains(p->one, needle, len, regexp))
119 120 121
					has_changes = 1;
			}
			else if (!diff_unmodified_pair(p) &&
122 123
				 contains(p->one, needle, len, regexp) !=
				 contains(p->two, needle, len, regexp))
124 125 126
				has_changes = 1;

			if (has_changes)
Junio C Hamano's avatar
Junio C Hamano committed
127
				diff_q(&outq, p);
128 129
			else
				diff_free_filepair(p);
130
		}
131

132 133 134 135
	if (opts & DIFF_PICKAXE_REGEX) {
		regfree(&regex);
	}

136 137 138 139
	free(q->queue);
	*q = outq;
	return;
}