Function get_revision

revision.c:4659–4714

}

struct commit *get_revision(struct rev_info *revs)
{
	struct commit *c;
	struct commit_list *reversed;
	struct commit_list *queue = NULL;
	struct commit_list *p;

	if (revs->max_count_type == 1 && !revs->max_count_stage) {
		retrieve_oldest_commits(revs, &queue);
		commit_list_free(revs->commits);
		revs->commits = queue;
		revs->max_count_stage = 1;
	}

	if (revs->reverse) {
		reversed = NULL;
		if (revs->max_count_type == 1)
			while ((c = pop_commit(&revs->commits)))
				commit_list_insert(c, &reversed);
		else
			while ((c = get_revision_internal(revs)))
				commit_list_insert(c, &reversed);
		commit_list_free(revs->commits);
		revs->commits = reversed;
		revs->reverse = 0;
		revs->reverse_output_stage = 1;
	}

	if (revs->reverse_output_stage) {
		c = pop_commit(&revs->commits);
		if (revs->track_linear)
			revs->linear = !!(c && c->object.flags & TRACK_LINEAR);
		return c;
	}

	if (revs->max_count_stage) {
		c = pop_commit(&revs->commits);
		if (c) {
			c->object.flags |= SHOWN;
			if (!(c->object.flags & BOUNDARY))
				for (p = c->parents; p; p = p->next)
					p->item->object.flags |= CHILD_SHOWN;
		}
	} else {
		c = get_revision_internal(revs);
	}

	if (c && revs->graph)
		graph_update(revs->graph, c);
	if (!c) {
		free_saved_parents(revs);
		commit_list_free(revs->previous_parents);
		revs->previous_parents = NULL;
	}
	return c;
}

const char *get_revision_mark(const struct rev_info *revs, const struct commit *commit)