You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

LIFORevQueue.java 3.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121
  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. package org.eclipse.jgit.revwalk;
  45. import java.io.IOException;
  46. import org.eclipse.jgit.errors.IncorrectObjectTypeException;
  47. import org.eclipse.jgit.errors.MissingObjectException;
  48. /** A queue of commits in LIFO order. */
  49. public class LIFORevQueue extends BlockRevQueue {
  50. private Block head;
  51. /** Create an empty LIFO queue. */
  52. public LIFORevQueue() {
  53. super();
  54. }
  55. LIFORevQueue(final Generator s) throws MissingObjectException,
  56. IncorrectObjectTypeException, IOException {
  57. super(s);
  58. }
  59. public void add(final RevCommit c) {
  60. Block b = head;
  61. if (b == null || !b.canUnpop()) {
  62. b = free.newBlock();
  63. b.resetToEnd();
  64. b.next = head;
  65. head = b;
  66. }
  67. b.unpop(c);
  68. }
  69. public RevCommit next() {
  70. final Block b = head;
  71. if (b == null)
  72. return null;
  73. final RevCommit c = b.pop();
  74. if (b.isEmpty()) {
  75. head = b.next;
  76. free.freeBlock(b);
  77. }
  78. return c;
  79. }
  80. public void clear() {
  81. head = null;
  82. free.clear();
  83. }
  84. boolean everbodyHasFlag(final int f) {
  85. for (Block b = head; b != null; b = b.next) {
  86. for (int i = b.headIndex; i < b.tailIndex; i++)
  87. if ((b.commits[i].flags & f) == 0)
  88. return false;
  89. }
  90. return true;
  91. }
  92. boolean anybodyHasFlag(final int f) {
  93. for (Block b = head; b != null; b = b.next) {
  94. for (int i = b.headIndex; i < b.tailIndex; i++)
  95. if ((b.commits[i].flags & f) != 0)
  96. return true;
  97. }
  98. return false;
  99. }
  100. public String toString() {
  101. final StringBuilder s = new StringBuilder();
  102. for (Block q = head; q != null; q = q.next) {
  103. for (int i = q.headIndex; i < q.tailIndex; i++)
  104. describe(s, q.commits[i]);
  105. }
  106. return s.toString();
  107. }
  108. }