Function check_recursion_depth

tree-diff.c:57–98

}

static int check_recursion_depth(const struct strbuf *name,
				 const struct pathspec *ps,
				 int max_depth)
{
	int i;

	if (!ps->nr)
		return within_depth(name->buf, name->len, 1, max_depth);

	/*
	 * We look through the pathspecs in reverse-sorted order, because we
	 * want to find the longest match first (e.g., "a/b" is better for
	 * checking depth than "a/b/c").
	 */
	for (i = ps->nr - 1; i >= 0; i--) {
		const struct pathspec_item *item = ps->items+i;

		/*
		 * If the name to match is longer than the pathspec, then we
		 * are only interested if the pathspec matches and we are
		 * within the allowed depth.
		 */
		if (name->len >= item->len) {
			if (!is_dir_prefix(name->buf, item->match, item->len))
				continue;
			return within_depth(name->buf + item->len,
					    name->len - item->len,
					    1, max_depth);
		}

		/*
		 * Otherwise, our name is shorter than the pathspec. We need to
		 * check if it is a prefix of the pathspec; if so, we must
		 * always recurse in order to process further (the resulting
		 * paths we find might or might not match our pathspec, but we
		 * cannot know until we recurse).
		 */
		if (is_dir_prefix(item->match, name->buf, name->len))
			return 1;
	}
	return 0;
}

static int should_recurse(const struct strbuf *name, struct diff_options *opt)
{