blob: 905dcb62ad89642ef4313f5bd7cce5b87caf106c (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
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
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
|
/*
* Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>,
* Copyright (C) 2013, Gustaf Lundh <gustaf.lundh@sonymobile.com> and others
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Distribution License v. 1.0 which is available at
* https://www.eclipse.org/org/documents/edl-v10.php.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
package org.eclipse.jgit.revwalk;
import java.io.IOException;
import org.eclipse.jgit.annotations.Nullable;
import org.eclipse.jgit.errors.IncorrectObjectTypeException;
import org.eclipse.jgit.errors.MissingObjectException;
/**
* A queue of commits sorted by commit time order.
*/
public class DateRevQueue extends AbstractRevQueue {
private static final int REBUILD_INDEX_COUNT = 1000;
private Entry head;
private Entry free;
private int inQueue;
private int sinceLastIndex;
private Entry[] index;
private int first;
private int last = -1;
/** Create an empty DateRevQueue. */
public DateRevQueue() {
super(false);
}
/**
* Create an empty DateRevQueue.
*
* @param firstParent
* treat first element as a parent
*/
DateRevQueue(boolean firstParent) {
super(firstParent);
}
DateRevQueue(Generator s) throws MissingObjectException,
IncorrectObjectTypeException, IOException {
super(s.firstParent);
for (;;) {
final RevCommit c = s.next();
if (c == null)
break;
add(c);
}
}
@Override
public void add(RevCommit c) {
sinceLastIndex++;
if (++inQueue > REBUILD_INDEX_COUNT
&& sinceLastIndex > REBUILD_INDEX_COUNT)
buildIndex();
Entry q = head;
final long when = c.commitTime;
if (first <= last && index[first].commit.commitTime > when) {
int low = first, high = last;
while (low <= high) {
int mid = (low + high) >>> 1;
int t = index[mid].commit.commitTime;
if (t < when)
high = mid - 1;
else if (t > when)
low = mid + 1;
else {
low = mid - 1;
break;
}
}
low = Math.min(low, high);
while (low > first && when == index[low].commit.commitTime)
--low;
q = index[low];
}
final Entry n = newEntry(c);
if (q == null || (q == head && when > q.commit.commitTime)) {
n.next = q;
head = n;
} else {
Entry p = q.next;
while (p != null && p.commit.commitTime >= when) {
q = p;
p = q.next;
}
n.next = q.next;
q.next = n;
}
}
@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;
}
private void buildIndex() {
sinceLastIndex = 0;
first = 0;
index = new Entry[inQueue / 100 + 1];
int qi = 0, ii = 0;
for (Entry q = head; q != null; q = q.next) {
if (++qi % 100 == 0)
index[ii++] = q;
}
last = ii - 1;
}
/**
* Peek at the next commit, without removing it.
*
* @return the next available commit; null if there are no commits left.
*/
public @Nullable RevCommit peek() {
return head != null ? head.commit : null;
}
@Override
public void clear() {
head = null;
free = null;
index = null;
inQueue = 0;
sinceLastIndex = 0;
last = -1;
}
@Override
boolean everbodyHasFlag(int f) {
for (Entry q = head; q != null; q = q.next) {
if ((q.commit.flags & f) == 0)
return false;
}
return true;
}
@Override
boolean anybodyHasFlag(int f) {
for (Entry q = head; q != null; q = q.next) {
if ((q.commit.flags & f) != 0)
return true;
}
return false;
}
@Override
int outputType() {
return outputType | SORT_COMMIT_TIME_DESC;
}
@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();
}
private Entry newEntry(RevCommit c) {
Entry r = free;
if (r == null)
r = new Entry();
else
free = r.next;
r.commit = c;
return r;
}
private void freeEntry(Entry e) {
e.next = free;
free = e;
}
static class Entry {
Entry next;
RevCommit commit;
}
}
|
