MergeBaseGenerator(RevWalk w) { walker = w; pending = new DateRevQueue(); }
try { for (;;) { final RevCommit c = pending.next(); if (c == null) { return null; p.parseHeaders(walker); p.flags |= SEEN; pending.add(p); if (pending.everbodyHasFlag(UNINTERESTING)) { final RevCommit n = pending.peek(); if (n != null && n.commitTime >= last.commitTime) { pending.clear(); return null;
if (++inQueue > REBUILD_INDEX_COUNT && sinceLastIndex > REBUILD_INDEX_COUNT) buildIndex(); final Entry n = newEntry(c); if (q == null || (q == head && when > q.commit.commitTime)) { n.next = q;
private RevCommit _next() throws MissingObjectException, IncorrectObjectTypeException, IOException { for (;;) { final RevCommit c = pending.next(); if (c == null) { return null; p.parseHeaders(walker); p.flags |= IN_PENDING; pending.add(p); if (pending.everbodyHasFlag(MERGE_BASE)) return null; continue;
pending = (DateRevQueue)q; else pending = new DateRevQueue(q); if (tf != TreeFilter.ALL) { int rewriteFlag; if (pending.peek() != null) g = new DelayRevQueue(g); g = new FixUninterestingGenerator(g);
DateRevQueue(Generator s) throws MissingObjectException, IncorrectObjectTypeException, IOException { for (;;) { final RevCommit c = s.next(); if (c == null) break; add(c); } }
private void markLocalCommitsComplete(int until) throws TransportException { try { for (;;) { final RevCommit c = localCommitQueue.peek(); if (c == null || c.getCommitTime() < until) return; localCommitQueue.next(); markTreeComplete(c.getTree()); for (RevCommit p : c.getParents()) pushLocalCommit(p); } } catch (IOException err) { throw new TransportException(JGitText.get().localObjectsIncomplete, err); } }
/** {@inheritDoc} */ @Override public String toString() { final StringBuilder s = new StringBuilder(); for (Entry q = head; q != null; q = q.next) describe(s, q.commit); return s.toString(); }
/** {@inheritDoc} */ @Override public RevCommit next() { final Entry q = head; if (q == null) return null; if (index != null && q == index[first]) index[first++] = null; inQueue--; head = q.next; freeEntry(q); return q.commit; }
if (commit.has(cached) && queue.everbodyHasFlag(cached.mask)) { for (Map.Entry<String, Value> entry: lastCommits.entrySet()) { String child = entry.getKey();
private RevCommit _next() throws MissingObjectException, IncorrectObjectTypeException, IOException { for (;;) { final RevCommit c = pending.next(); if (c == null) { return null; p.parseHeaders(walker); p.flags |= IN_PENDING; pending.add(p); if (pending.everbodyHasFlag(MERGE_BASE)) return null; continue;
pending = (DateRevQueue)q; else pending = new DateRevQueue(q); if (tf != TreeFilter.ALL) { int rewriteFlag; if (pending.peek() != null) g = new DelayRevQueue(g); g = new FixUninterestingGenerator(g);
private int carryOntoOne(RevCommit p, int carry) { // If we already had all carried flags, our parents do too. // Return HAVE_ALL to stop caller from running down this leg // of the revision graph any further. // // Otherwise return CONTINUE to ask the caller to walk history. int rc = (p.flags & carry) == carry ? HAVE_ALL : CONTINUE; p.flags |= carry; if ((p.flags & recarryMask) == recarryTest) { // We were popped without being a merge base, but we just got // voted to be one. Inject ourselves back at the front of the // pending queue and tell all of our ancestors they are within // the merge base now. p.flags &= ~POPPED; pending.add(p); stack = new CarryStack(stack, p, branchMask | MERGE_BASE); return CONTINUE_ON_STACK; } return rc; }
private void markLocalCommitsComplete(final int until) throws TransportException { try { for (;;) { final RevCommit c = localCommitQueue.peek(); if (c == null || c.getCommitTime() < until) return; localCommitQueue.next(); markTreeComplete(c.getTree()); for (final RevCommit p : c.getParents()) pushLocalCommit(p); } } catch (IOException err) { throw new TransportException(JGitText.get().localObjectsIncomplete, err); } }
public String toString() { final StringBuilder s = new StringBuilder(); for (Entry q = head; q != null; q = q.next) describe(s, q.commit); return s.toString(); }
public RevCommit next() { final Entry q = head; if (q == null) return null; if (index != null && q == index[first]) index[first++] = null; inQueue--; head = q.next; freeEntry(q); return q.commit; }
try { for (;;) { final RevCommit c = pending.next(); if (c == null) { return null; p.parseHeaders(walker); p.flags |= SEEN; pending.add(p); if (pending.everbodyHasFlag(UNINTERESTING)) { final RevCommit n = pending.peek(); if (n != null && n.commitTime >= last.commitTime) { pending.clear(); return null;
private RevCommit _next() throws MissingObjectException, IncorrectObjectTypeException, IOException { for (;;) { final RevCommit c = pending.next(); if (c == null) { return null; p.parseHeaders(walker); p.flags |= IN_PENDING; pending.add(p); if (pending.everbodyHasFlag(MERGE_BASE)) return null; continue;
private RevWalk(ObjectReader or, boolean closeReader) { reader = or; idBuffer = new MutableObjectId(); objects = new ObjectIdOwnerMap<>(); roots = new ArrayList<>(); queue = new DateRevQueue(); pending = new StartGenerator(this); sorting = EnumSet.of(RevSort.NONE); filter = RevFilter.ALL; treeFilter = TreeFilter.ALL; this.closeReader = closeReader; }
if (++inQueue > REBUILD_INDEX_COUNT && sinceLastIndex > REBUILD_INDEX_COUNT) buildIndex(); final Entry n = newEntry(c); if (q == null || (q == head && when > q.commit.commitTime)) { n.next = q;