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  		super(s.firstParent);
59  		g = new InitialGenerator(w, s);
60  	}
61  
62  	@Override
63  	int outputType() {
64  		return g.outputType() | HAS_UNINTERESTING;
65  	}
66  
67  	@Override
68  	void shareFreeList(BlockRevQueue q) {
69  		g.shareFreeList(q);
70  	}
71  
72  	@Override
73  	RevCommit next() throws MissingObjectException,
74  			IncorrectObjectTypeException, IOException {
75  		return g.next();
76  	}
77  
78  	private class InitialGenerator extends Generator {
79  		private static final int PARSED = RevWalk.PARSED;
80  
81  		private static final int DUPLICATE = RevWalk.TEMP_MARK;
82  
83  		private final RevWalk walk;
84  
85  		private final FIFORevQueue held;
86  
87  		private final Generator source;
88  
89  		InitialGenerator(RevWalk w, Generator s) {
90  			super(s.firstParent);
91  			walk = w;
92  			held = new FIFORevQueue(firstParent);
93  			source = s;
94  			source.shareFreeList(held);
95  		}
96  
97  		@Override
98  		int outputType() {
99  			return source.outputType();
100 		}
101 
102 		@Override
103 		void shareFreeList(BlockRevQueue q) {
104 			q.shareFreeList(held);
105 		}
106 
107 		@Override
108 		RevCommit next() throws MissingObjectException,
109 				IncorrectObjectTypeException, IOException {
110 			RevCommit c = source.next();
111 			if (c != null) {
112 				for (int i = 0; i < c.parents.length; i++) {
113 					if (firstParent && i > 0) {
114 						break;
115 					}
116 					RevCommit p = c.parents[i];
117 					if ((p.flags & UNINTERESTING) != 0) {
118 						held.add(p);
119 					}
120 				}
121 				return c;
122 			}
123 
124 			final FIFORevQueuee.html#FIFORevQueue">FIFORevQueue boundary = new FIFORevQueue(firstParent);
125 			boundary.shareFreeList(held);
126 			for (;;) {
127 				c = held.next();
128 				if (c == null)
129 					break;
130 				if ((c.flags & DUPLICATE) != 0)
131 					continue;
132 				if ((c.flags & PARSED) == 0)
133 					c.parseHeaders(walk);
134 				c.flags |= DUPLICATE;
135 				boundary.add(c);
136 			}
137 			boundary.removeFlag(DUPLICATE);
138 			g = boundary;
139 			return boundary.next();
140 		}
141 	}
142 }