internal virtual void Init(AbstractRevQueue p)
{
try
{
for (; ;)
{
RevCommit c = p.Next();
if (c == null)
{
break;
}
Add(c);
}
}
finally
{
// Always free the flags immediately. This ensures the flags
// will be available for reuse when the walk resets.
//
walker.FreeFlag(branchMask);
// Setup the condition used by carryOntoOne to detect a late
// merge base and produce it on the next round.
//
recarryTest = branchMask | POPPED;
recarryMask = branchMask | POPPED | MERGE_BASE;
}
}
internal virtual void Init(AbstractRevQueue p)
{
try
{
for (; ; )
{
RevCommit c = p.Next();
if (c == null)
{
break;
}
Add(c);
}
}
finally
{
// Always free the flags immediately. This ensures the flags
// will be available for reuse when the walk resets.
//
walker.FreeFlag(branchMask);
// Setup the condition used by carryOntoOne to detect a late
// merge base and produce it on the next round.
//
recarryTest = branchMask | POPPED;
recarryMask = branchMask | POPPED | MERGE_BASE;
}
}
/// <exception cref="NGit.Errors.MissingObjectException"></exception>
/// <exception cref="NGit.Errors.IncorrectObjectTypeException"></exception>
/// <exception cref="System.IO.IOException"></exception>
internal override RevCommit Next()
{
Generator g;
RevWalk w = walker;
RevFilter rf = w.GetRevFilter();
TreeFilter tf = w.GetTreeFilter();
AbstractRevQueue q = walker.queue;
w.reader.WalkAdviceBeginCommits(w, w.roots);
if (rf == RevFilter.MERGE_BASE)
{
// Computing for merge bases is a special case and does not
// use the bulk of the generator pipeline.
//
if (tf != TreeFilter.ALL)
{
throw new InvalidOperationException(MessageFormat.Format(JGitText.Get().cannotCombineTreeFilterWithRevFilter
, tf, rf));
}
MergeBaseGenerator mbg = new MergeBaseGenerator(w);
walker.pending = mbg;
walker.queue = AbstractRevQueue.EMPTY_QUEUE;
mbg.Init(q);
return(mbg.Next());
}
bool uninteresting = q.AnybodyHasFlag(RevWalk.UNINTERESTING);
bool boundary = walker.HasRevSort(RevSort.BOUNDARY);
if (!boundary && walker is ObjectWalk)
{
// The object walker requires boundary support to color
// trees and blobs at the boundary uninteresting so it
// does not produce those in the result.
//
boundary = true;
}
if (boundary && !uninteresting)
{
// If we were not fed uninteresting commits we will never
// construct a boundary. There is no reason to include the
// extra overhead associated with that in our pipeline.
//
boundary = false;
}
DateRevQueue pending;
int pendingOutputType = 0;
if (q is DateRevQueue)
{
pending = (DateRevQueue)q;
}
else
{
pending = new DateRevQueue(q);
}
if (tf != TreeFilter.ALL)
{
rf = AndRevFilter.Create(new RewriteTreeFilter(w, tf), rf);
pendingOutputType |= HAS_REWRITE | NEEDS_REWRITE;
}
walker.queue = q;
if (walker is DepthWalk)
{
DepthWalk dw = (DepthWalk)walker;
g = new DepthGenerator(dw, pending);
}
else
{
g = new PendingGenerator(w, pending, rf, pendingOutputType);
if (boundary)
{
// Because the boundary generator may produce uninteresting
// commits we cannot allow the pending generator to dispose
// of them early.
//
((PendingGenerator)g).canDispose = false;
}
}
if ((g.OutputType() & NEEDS_REWRITE) != 0)
{
// Correction for an upstream NEEDS_REWRITE is to buffer
// fully and then apply a rewrite generator that can
// pull through the rewrite chain and produce a dense
// output graph.
//
g = new FIFORevQueue(g);
g = new RewriteGenerator(g);
}
if (walker.HasRevSort(RevSort.TOPO) && (g.OutputType() & SORT_TOPO) == 0)
{
g = new TopoSortGenerator(g);
}
if (walker.HasRevSort(RevSort.REVERSE))
{
g = new LIFORevQueue(g);
}
if (boundary)
{
g = new BoundaryGenerator(w, g);
}
else
{
if (uninteresting)
{
// Try to protect ourselves from uninteresting commits producing
// due to clock skew in the commit time stamps. Delay such that
// we have a chance at coloring enough of the graph correctly,
// and then strip any UNINTERESTING nodes that may have leaked
// through early.
//
if (pending.Peek() != null)
{
g = new DelayRevQueue(g);
}
g = new FixUninterestingGenerator(g);
}
}
w.pending = g;
return(g.Next());
}