diffcore-pickaxe.c 2.48 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 9
static unsigned int contains(struct diff_filespec *one,
			     const char *needle, unsigned long len)
10
{
11
	unsigned int cnt;
12 13
	unsigned long offset, sz;
	const char *data;
14
	if (diff_populate_filespec(one, 0))
15
		return 0;
16

17 18
	sz = one->size;
	data = one->data;
19 20 21 22 23 24 25 26 27 28 29 30 31
	cnt = 0;

	/* 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++;
		}
	}
	return cnt;
32 33
}

34
void diffcore_pickaxe(const char *needle, int opts)
35
{
36
	struct diff_queue_struct *q = &diff_queued_diff;
37
	unsigned long len = strlen(needle);
38
	int i, has_changes;
39 40 41 42
	struct diff_queue_struct outq;
	outq.queue = NULL;
	outq.nr = outq.alloc = 0;

43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
	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 */
				if (contains(p->two, needle, len))
					has_changes++;
			}
			else if (!DIFF_FILE_VALID(p->two)) {
				if (contains(p->one, needle, len))
					has_changes++;
			}
			else if (!diff_unmodified_pair(p) &&
				 contains(p->one, needle, len) !=
				 contains(p->two, needle, len))
				has_changes++;
62
		}
63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95
		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 */
				else if (contains(p->two, needle, len))
					has_changes = 1;
			}
			else if (!DIFF_FILE_VALID(p->two)) {
				if (contains(p->one, needle, len))
					has_changes = 1;
			}
			else if (!diff_unmodified_pair(p) &&
				 contains(p->one, needle, len) !=
				 contains(p->two, needle, len))
				has_changes = 1;

			if (has_changes)
Junio C Hamano's avatar
Junio C Hamano committed
96
				diff_q(&outq, p);
97 98
			else
				diff_free_filepair(p);
99
		}
100

101 102 103 104
	free(q->queue);
	*q = outq;
	return;
}