Optimized "IncludedIn" Algorithm
The most expensive part of the "IncludedIn" calculation is the processing of paths which do not contain the requested commit. In that case the processor needs to look at all reachable commits starting from the tip commit to the initial commit. The method RevWalk.isMergedIn() walks over the whole parent graph again and again for each tag and each branch. The amount of walks can be reduced by sorting the tags and branches and start bottom up. This allows ignoring subgraphs where the commit is not contained in subsequent iterations and stop graph traversal when a tag or branch is reached where we already know that it contains the commit. Performance measurement on larger Git repositories, like Linux Kernel, indicate that the runtime with the new algorithm is three to four times faster. To be able to expose the "IncludedIn" calculation as a REST service or SSH command I have extracted the algorithm into an own class in the gerrit-server package. Change-Id: I56b32a77e02e47dd31ec6ce4adfe0a781e73a76c Signed-off-by: Christian Grail <christian.grail@sap.com>
This commit is contained in:

committed by
Saša Živkov

parent
ac3d66305c
commit
52b7f60f3d
@@ -0,0 +1,159 @@
|
||||
// Copyright (C) 2013 The Android Open Source Project
|
||||
//
|
||||
// Licensed under the Apache License, Version 2.0 (the "License");
|
||||
// you may not use this file except in compliance with the License.
|
||||
// You may obtain a copy of the License at
|
||||
//
|
||||
// http://www.apache.org/licenses/LICENSE-2.0
|
||||
//
|
||||
// Unless required by applicable law or agreed to in writing, software
|
||||
// distributed under the License is distributed on an "AS IS" BASIS,
|
||||
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
// See the License for the specific language governing permissions and
|
||||
// limitations under the License.
|
||||
|
||||
package com.google.gerrit.server.change;
|
||||
|
||||
import com.google.gerrit.common.data.IncludedInDetail;
|
||||
|
||||
import org.eclipse.jgit.errors.IncorrectObjectTypeException;
|
||||
import org.eclipse.jgit.errors.MissingObjectException;
|
||||
import org.eclipse.jgit.lib.Constants;
|
||||
import org.eclipse.jgit.lib.Ref;
|
||||
import org.eclipse.jgit.lib.Repository;
|
||||
import org.eclipse.jgit.revwalk.RevCommit;
|
||||
import org.eclipse.jgit.revwalk.RevFlag;
|
||||
import org.eclipse.jgit.revwalk.RevWalk;
|
||||
import org.slf4j.Logger;
|
||||
import org.slf4j.LoggerFactory;
|
||||
|
||||
import java.io.IOException;
|
||||
import java.util.ArrayList;
|
||||
import java.util.Collections;
|
||||
import java.util.Comparator;
|
||||
import java.util.HashMap;
|
||||
import java.util.HashSet;
|
||||
import java.util.List;
|
||||
import java.util.Map;
|
||||
import java.util.Set;
|
||||
|
||||
/**
|
||||
* Resolve in which tags and branches a commit is included.
|
||||
*/
|
||||
public class IncludedInResolver {
|
||||
|
||||
private static final Logger log = LoggerFactory
|
||||
.getLogger(IncludedInResolver.class);
|
||||
|
||||
public static IncludedInDetail resolve(final Repository repo,
|
||||
final RevWalk rw, final RevCommit commit) throws IOException {
|
||||
|
||||
Set<Ref> tags =
|
||||
new HashSet<Ref>(repo.getRefDatabase().getRefs(Constants.R_TAGS)
|
||||
.values());
|
||||
Set<Ref> branches =
|
||||
new HashSet<Ref>(repo.getRefDatabase().getRefs(Constants.R_HEADS)
|
||||
.values());
|
||||
Set<Ref> allTagsAndBranches = new HashSet<Ref>();
|
||||
allTagsAndBranches.addAll(tags);
|
||||
allTagsAndBranches.addAll(branches);
|
||||
Set<Ref> allMatchingTagsAndBranches =
|
||||
includedIn(repo, rw, commit, allTagsAndBranches);
|
||||
|
||||
IncludedInDetail detail = new IncludedInDetail();
|
||||
detail
|
||||
.setBranches(getMatchingRefNames(allMatchingTagsAndBranches, branches));
|
||||
detail.setTags(getMatchingRefNames(allMatchingTagsAndBranches, tags));
|
||||
|
||||
return detail;
|
||||
}
|
||||
|
||||
/**
|
||||
* Resolves which tip refs include the target commit.
|
||||
*/
|
||||
private static Set<Ref> includedIn(final Repository repo, final RevWalk rw,
|
||||
final RevCommit target, final Set<Ref> tipRefs) throws IOException,
|
||||
MissingObjectException, IncorrectObjectTypeException {
|
||||
|
||||
Set<Ref> result = new HashSet<Ref>();
|
||||
|
||||
Map<RevCommit, Set<Ref>> tipsAndCommits = parseCommits(repo, rw, tipRefs);
|
||||
|
||||
List<RevCommit> tips = new ArrayList<RevCommit>(tipsAndCommits.keySet());
|
||||
Collections.sort(tips, new Comparator<RevCommit>() {
|
||||
@Override
|
||||
public int compare(RevCommit c1, RevCommit c2) {
|
||||
return c1.getCommitTime() - c2.getCommitTime();
|
||||
}
|
||||
});
|
||||
|
||||
Set<RevCommit> targetReachableFrom = new HashSet<RevCommit>();
|
||||
targetReachableFrom.add(target);
|
||||
|
||||
for (RevCommit tip : tips) {
|
||||
boolean commitFound = false;
|
||||
rw.resetRetain(RevFlag.UNINTERESTING);
|
||||
rw.markStart(tip);
|
||||
for (RevCommit commit : rw) {
|
||||
if (targetReachableFrom.contains(commit)) {
|
||||
commitFound = true;
|
||||
targetReachableFrom.add(tip);
|
||||
result.addAll(tipsAndCommits.get(tip));
|
||||
break;
|
||||
}
|
||||
}
|
||||
if (!commitFound) {
|
||||
rw.markUninteresting(tip);
|
||||
}
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
|
||||
/**
|
||||
* Returns the short names of refs which are as well in the matchingRefs list
|
||||
* as well as in the allRef list.
|
||||
*/
|
||||
private static List<String> getMatchingRefNames(Set<Ref> matchingRefs,
|
||||
Set<Ref> allRefs) {
|
||||
List<String> refNames = new ArrayList<String>();
|
||||
for (Ref matchingRef : matchingRefs) {
|
||||
if (allRefs.contains(matchingRef)) {
|
||||
refNames.add(Repository.shortenRefName(matchingRef.getName()));
|
||||
}
|
||||
}
|
||||
return refNames;
|
||||
}
|
||||
|
||||
/**
|
||||
* Parse commit of ref and store the relation between ref and commit.
|
||||
*/
|
||||
private static Map<RevCommit, Set<Ref>> parseCommits(final Repository repo,
|
||||
final RevWalk rw, final Set<Ref> refs) throws IOException {
|
||||
Map<RevCommit, Set<Ref>> result = new HashMap<RevCommit, Set<Ref>>();
|
||||
for (Ref ref : refs) {
|
||||
final RevCommit commit;
|
||||
try {
|
||||
commit = rw.parseCommit(ref.getObjectId());
|
||||
} catch (IncorrectObjectTypeException notCommit) {
|
||||
// Its OK for a tag reference to point to a blob or a tree, this
|
||||
// is common in the Linux kernel or git.git repository.
|
||||
//
|
||||
continue;
|
||||
} catch (MissingObjectException notHere) {
|
||||
// Log the problem with this branch, but keep processing.
|
||||
//
|
||||
log.warn("Reference " + ref.getName() + " in " + repo.getDirectory()
|
||||
+ " points to dangling object " + ref.getObjectId());
|
||||
continue;
|
||||
}
|
||||
Set<Ref> relatedRefs = result.get(commit);
|
||||
if (relatedRefs == null) {
|
||||
relatedRefs = new HashSet<Ref>();
|
||||
result.put(commit, relatedRefs);
|
||||
}
|
||||
relatedRefs.add(ref);
|
||||
}
|
||||
return result;
|
||||
}
|
||||
}
|
Reference in New Issue
Block a user