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