View Javadoc
1   /*
2    * Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
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.revwalk;
45  
46  import java.io.IOException;
47  
48  import org.eclipse.jgit.errors.IncorrectObjectTypeException;
49  import org.eclipse.jgit.errors.MissingObjectException;
50  
51  /**
52   * A queue of commits in FIFO order.
53   */
54  public class FIFORevQueue extends BlockRevQueue {
55  	private Block head;
56  
57  	private Block tail;
58  
59  	/** Create an empty FIFO queue. */
60  	public FIFORevQueue() {
61  		super(false);
62  	}
63  
64  	FIFORevQueue(boolean firstParent) {
65  		super(firstParent);
66  	}
67  
68  	FIFORevQueue(Generator s) throws MissingObjectException,
69  			IncorrectObjectTypeException, IOException {
70  		super(s);
71  	}
72  
73  	/** {@inheritDoc} */
74  	@Override
75  	public void add(RevCommit c) {
76  		Block b = tail;
77  		if (b == null) {
78  			b = free.newBlock();
79  			b.add(c);
80  			head = b;
81  			tail = b;
82  			return;
83  		} else if (b.isFull()) {
84  			b = free.newBlock();
85  			tail.next = b;
86  			tail = b;
87  		}
88  		b.add(c);
89  	}
90  
91  	/**
92  	 * Insert the commit pointer at the front of the queue.
93  	 *
94  	 * @param c
95  	 *            the commit to insert into the queue.
96  	 */
97  	public void unpop(RevCommit c) {
98  		Block b = head;
99  		if (b == null) {
100 			b = free.newBlock();
101 			b.resetToMiddle();
102 			b.add(c);
103 			head = b;
104 			tail = b;
105 			return;
106 		} else if (b.canUnpop()) {
107 			b.unpop(c);
108 			return;
109 		}
110 
111 		b = free.newBlock();
112 		b.resetToEnd();
113 		b.unpop(c);
114 		b.next = head;
115 		head = b;
116 	}
117 
118 	/** {@inheritDoc} */
119 	@Override
120 	public RevCommit next() {
121 		final Block b = head;
122 		if (b == null)
123 			return null;
124 
125 		final RevCommit c = b.pop();
126 		if (b.isEmpty()) {
127 			head = b.next;
128 			if (head == null)
129 				tail = null;
130 			free.freeBlock(b);
131 		}
132 		return c;
133 	}
134 
135 	/** {@inheritDoc} */
136 	@Override
137 	public void clear() {
138 		head = null;
139 		tail = null;
140 		free.clear();
141 	}
142 
143 	@Override
144 	boolean everbodyHasFlag(int f) {
145 		for (Block b = head; b != null; b = b.next) {
146 			for (int i = b.headIndex; i < b.tailIndex; i++)
147 				if ((b.commits[i].flags & f) == 0)
148 					return false;
149 		}
150 		return true;
151 	}
152 
153 	@Override
154 	boolean anybodyHasFlag(int f) {
155 		for (Block b = head; b != null; b = b.next) {
156 			for (int i = b.headIndex; i < b.tailIndex; i++)
157 				if ((b.commits[i].flags & f) != 0)
158 					return true;
159 		}
160 		return false;
161 	}
162 
163 	void removeFlag(int f) {
164 		final int not_f = ~f;
165 		for (Block b = head; b != null; b = b.next) {
166 			for (int i = b.headIndex; i < b.tailIndex; i++)
167 				b.commits[i].flags &= not_f;
168 		}
169 	}
170 
171 	/** {@inheritDoc} */
172 	@Override
173 	public String toString() {
174 		final StringBuilder s = new StringBuilder();
175 		for (Block q = head; q != null; q = q.next) {
176 			for (int i = q.headIndex; i < q.tailIndex; i++)
177 				describe(s, q.commits[i]);
178 		}
179 		return s.toString();
180 	}
181 }