View Javadoc
1   /*
2    * Copyright (C) 2017, Google Inc.
3    * and other copyright owners as documented in the project's IP log.
4    *
5    * This program and the accompanying materials are made available
6    * under the terms of the Eclipse Distribution License v1.0 which
7    * accompanies this distribution, is reproduced below, and is
8    * available at http://www.eclipse.org/org/documents/edl-v10.php
9    *
10   * All rights reserved.
11   *
12   * Redistribution and use in source and binary forms, with or
13   * without modification, are permitted provided that the following
14   * conditions are met:
15   *
16   * - Redistributions of source code must retain the above copyright
17   *   notice, this list of conditions and the following disclaimer.
18   *
19   * - Redistributions in binary form must reproduce the above
20   *   copyright notice, this list of conditions and the following
21   *   disclaimer in the documentation and/or other materials provided
22   *   with the distribution.
23   *
24   * - Neither the name of the Eclipse Foundation, Inc. nor the
25   *   names of its contributors may be used to endorse or promote
26   *   products derived from this software without specific prior
27   *   written permission.
28   *
29   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
30   * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
31   * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
32   * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33   * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
34   * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
35   * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
36   * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
37   * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
38   * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
39   * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
40   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
41   * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
42   */
43  
44  package org.eclipse.jgit.internal.revwalk;
45  
46  import org.eclipse.jgit.lib.BitmapIndex.Bitmap;
47  import org.eclipse.jgit.lib.BitmapIndex.BitmapBuilder;
48  import org.eclipse.jgit.lib.Constants;
49  import org.eclipse.jgit.revwalk.filter.RevFilter;
50  import org.eclipse.jgit.revwalk.RevWalk;
51  import org.eclipse.jgit.revwalk.RevCommit;
52  import org.eclipse.jgit.revwalk.RevFlag;
53  
54  /**
55   * A RevFilter that adds the visited commits to {@code bitmap} as a side
56   * effect.
57   * <p>
58   * When the walk hits a commit that is part of {@code bitmap}'s
59   * BitmapIndex, that entire bitmap is ORed into {@code bitmap} and the
60   * commit and its parents are marked as SEEN so that the walk does not
61   * have to visit its ancestors.  This ensures the walk is very short if
62   * there is good bitmap coverage.
63   */
64  public class AddToBitmapFilter extends RevFilter {
65  	private final BitmapBuilder bitmap;
66  
67  	/**
68  	 * Create a filter that adds visited commits to the given bitmap.
69  	 *
70  	 * @param bitmap bitmap to write visited commits to
71  	 */
72  	public AddToBitmapFilter(BitmapBuilder bitmap) {
73  		this.bitmap = bitmap;
74  	}
75  
76  	/** {@inheritDoc} */
77  	@Override
78  	public final boolean include(RevWalk walker, RevCommit cmit) {
79  		Bitmap visitedBitmap;
80  
81  		if (bitmap.contains(cmit)) {
82  			// already included
83  		} else if ((visitedBitmap = bitmap.getBitmapIndex()
84  				.getBitmap(cmit)) != null) {
85  			bitmap.or(visitedBitmap);
86  		} else {
87  			bitmap.addObject(cmit, Constants.OBJ_COMMIT);
88  			return true;
89  		}
90  
91  		for (RevCommit p : cmit.getParents()) {
92  			p.add(RevFlag.SEEN);
93  		}
94  		return false;
95  	}
96  
97  	/** {@inheritDoc} */
98  	@Override
99  	public final RevFilter clone() {
100 		throw new UnsupportedOperationException();
101 	}
102 
103 	/** {@inheritDoc} */
104 	@Override
105 	public final boolean requiresCommitBody() {
106 		return false;
107 	}
108 }