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
|
/*
* Copyright (C) 2011, Google Inc. 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.internal.storage.pack;
import static org.eclipse.jgit.lib.Constants.OBJ_BLOB;
import static org.eclipse.jgit.lib.Constants.OBJ_TREE;
import java.io.IOException;
import java.util.List;
import java.util.Set;
import org.eclipse.jgit.errors.IncorrectObjectTypeException;
import org.eclipse.jgit.errors.MissingObjectException;
import org.eclipse.jgit.lib.AnyObjectId;
import org.eclipse.jgit.lib.FileMode;
import org.eclipse.jgit.lib.MutableObjectId;
import org.eclipse.jgit.lib.ObjectId;
import org.eclipse.jgit.lib.ObjectIdOwnerMap;
import org.eclipse.jgit.lib.ObjectLoader;
import org.eclipse.jgit.lib.ObjectReader;
import org.eclipse.jgit.lib.ProgressMonitor;
import org.eclipse.jgit.revwalk.RevTree;
import org.eclipse.jgit.treewalk.CanonicalTreeParser;
class BaseSearch {
private static final int M_BLOB = FileMode.REGULAR_FILE.getBits();
private static final int M_TREE = FileMode.TREE.getBits();
private final ProgressMonitor progress;
private final ObjectReader reader;
private final ObjectId[] baseTrees;
private final ObjectIdOwnerMap<ObjectToPack> objectsMap;
private final List<ObjectToPack> edgeObjects;
private final IntSet alreadyProcessed;
private final ObjectIdOwnerMap<TreeWithData> treeCache;
private final CanonicalTreeParser parser;
private final MutableObjectId idBuf;
BaseSearch(ProgressMonitor countingMonitor, Set<RevTree> bases,
ObjectIdOwnerMap<ObjectToPack> objects,
List<ObjectToPack> edges, ObjectReader or) {
progress = countingMonitor;
reader = or;
baseTrees = bases.toArray(new ObjectId[0]);
objectsMap = objects;
edgeObjects = edges;
alreadyProcessed = new IntSet();
treeCache = new ObjectIdOwnerMap<>();
parser = new CanonicalTreeParser();
idBuf = new MutableObjectId();
}
void addBase(int objectType, byte[] pathBuf, int pathLen, int pathHash)
throws IOException {
final int tailMode = modeForType(objectType);
if (tailMode == 0)
return;
if (!alreadyProcessed.add(pathHash))
return;
if (pathLen == 0) {
for (ObjectId root : baseTrees)
add(root, OBJ_TREE, pathHash);
return;
}
final int firstSlash = nextSlash(pathBuf, 0, pathLen);
CHECK_BASE: for (ObjectId root : baseTrees) {
int ptr = 0;
int end = firstSlash;
int mode = end != pathLen ? M_TREE : tailMode;
parser.reset(readTree(root));
while (!parser.eof()) {
int cmp = parser.pathCompare(pathBuf, ptr, end, mode);
if (cmp < 0) {
parser.next();
continue;
}
if (cmp > 0)
continue CHECK_BASE;
if (end == pathLen) {
if (parser.getEntryFileMode().getObjectType() == objectType) {
idBuf.fromRaw(parser.idBuffer(), parser.idOffset());
add(idBuf, objectType, pathHash);
}
continue CHECK_BASE;
}
if (!FileMode.TREE.equals(parser.getEntryRawMode()))
continue CHECK_BASE;
ptr = end + 1;
end = nextSlash(pathBuf, ptr, pathLen);
mode = end != pathLen ? M_TREE : tailMode;
idBuf.fromRaw(parser.idBuffer(), parser.idOffset());
parser.reset(readTree(idBuf));
}
}
}
private static int modeForType(int typeCode) {
switch (typeCode) {
case OBJ_TREE:
return M_TREE;
case OBJ_BLOB:
return M_BLOB;
default:
return 0;
}
}
private static int nextSlash(byte[] pathBuf, int ptr, int end) {
while (ptr < end && pathBuf[ptr] != '/')
ptr++;
return ptr;
}
@SuppressWarnings("ReferenceEquality")
private void add(AnyObjectId id, int objectType, int pathHash) {
ObjectToPack obj = new ObjectToPack(id, objectType);
obj.setEdge();
obj.setPathHash(pathHash);
if (objectsMap.addIfAbsent(obj) == obj) {
edgeObjects.add(obj);
progress.update(1);
}
}
private byte[] readTree(AnyObjectId id) throws MissingObjectException,
IncorrectObjectTypeException, IOException {
TreeWithData tree = treeCache.get(id);
if (tree != null)
return tree.buf;
ObjectLoader ldr = reader.open(id, OBJ_TREE);
byte[] buf = ldr.getCachedBytes(Integer.MAX_VALUE);
treeCache.add(new TreeWithData(id, buf));
return buf;
}
private static class TreeWithData extends ObjectIdOwnerMap.Entry {
final byte[] buf;
TreeWithData(AnyObjectId id, byte[] buf) {
super(id);
this.buf = buf;
}
}
}
|
