View Javadoc
1   /*
2    * Copyright (C) 2009, Google Inc.
3    * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
4    * and other copyright owners as documented in the project's IP log.
5    *
6    * This program and the accompanying materials are made available
7    * under the terms of the Eclipse Distribution License v1.0 which
8    * accompanies this distribution, is reproduced below, and is
9    * available at http://www.eclipse.org/org/documents/edl-v10.php
10   *
11   * All rights reserved.
12   *
13   * Redistribution and use in source and binary forms, with or
14   * without modification, are permitted provided that the following
15   * conditions are met:
16   *
17   * - Redistributions of source code must retain the above copyright
18   *   notice, this list of conditions and the following disclaimer.
19   *
20   * - Redistributions in binary form must reproduce the above
21   *   copyright notice, this list of conditions and the following
22   *   disclaimer in the documentation and/or other materials provided
23   *   with the distribution.
24   *
25   * - Neither the name of the Eclipse Foundation, Inc. nor the
26   *   names of its contributors may be used to endorse or promote
27   *   products derived from this software without specific prior
28   *   written permission.
29   *
30   * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
31   * CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
32   * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
33   * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
34   * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
35   * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
36   * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
37   * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
38   * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
39   * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
40   * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
41   * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
42   * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
43   */
44  
45  package org.eclipse.jgit.revwalk;
46  
47  import java.io.IOException;
48  
49  import org.eclipse.jgit.errors.IncorrectObjectTypeException;
50  import org.eclipse.jgit.errors.MissingObjectException;
51  
52  class BoundaryGenerator extends Generator {
53  	static final int UNINTERESTING = RevWalk.UNINTERESTING;
54  
55  	Generator g;
56  
57  	BoundaryGenerator(RevWalk w, Generator s) {
58  		g = new InitialGenerator(w, s);
59  	}
60  
61  	@Override
62  	int outputType() {
63  		return g.outputType() | HAS_UNINTERESTING;
64  	}
65  
66  	@Override
67  	void shareFreeList(BlockRevQueue q) {
68  		g.shareFreeList(q);
69  	}
70  
71  	@Override
72  	RevCommit next() throws MissingObjectException,
73  			IncorrectObjectTypeException, IOException {
74  		return g.next();
75  	}
76  
77  	private class InitialGenerator extends Generator {
78  		private static final int PARSED = RevWalk.PARSED;
79  
80  		private static final int DUPLICATE = RevWalk.TEMP_MARK;
81  
82  		private final RevWalk walk;
83  
84  		private final FIFORevQueue held;
85  
86  		private final Generator source;
87  
88  		InitialGenerator(RevWalk w, Generator s) {
89  			walk = w;
90  			held = new FIFORevQueue();
91  			source = s;
92  			source.shareFreeList(held);
93  		}
94  
95  		@Override
96  		int outputType() {
97  			return source.outputType();
98  		}
99  
100 		@Override
101 		void shareFreeList(BlockRevQueue q) {
102 			q.shareFreeList(held);
103 		}
104 
105 		@Override
106 		RevCommit next() throws MissingObjectException,
107 				IncorrectObjectTypeException, IOException {
108 			RevCommit c = source.next();
109 			if (c != null) {
110 				for (RevCommit p : c.parents)
111 					if ((p.flags & UNINTERESTING) != 0)
112 						held.add(p);
113 				return c;
114 			}
115 
116 			final FIFORevQueue boundary = new FIFORevQueue();
117 			boundary.shareFreeList(held);
118 			for (;;) {
119 				c = held.next();
120 				if (c == null)
121 					break;
122 				if ((c.flags & DUPLICATE) != 0)
123 					continue;
124 				if ((c.flags & PARSED) == 0)
125 					c.parseHeaders(walk);
126 				c.flags |= DUPLICATE;
127 				boundary.add(c);
128 			}
129 			boundary.removeFlag(DUPLICATE);
130 			g = boundary;
131 			return boundary.next();
132 		}
133 	}
134 }