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.

BlockObjQueue.java 3.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144
  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. package org.eclipse.jgit.revwalk;
  44. class BlockObjQueue {
  45. private BlockFreeList free;
  46. private Block head;
  47. private Block tail;
  48. /** Create an empty queue. */
  49. BlockObjQueue() {
  50. free = new BlockFreeList();
  51. }
  52. void add(final RevObject c) {
  53. Block b = tail;
  54. if (b == null) {
  55. b = free.newBlock();
  56. b.add(c);
  57. head = b;
  58. tail = b;
  59. return;
  60. } else if (b.isFull()) {
  61. b = free.newBlock();
  62. tail.next = b;
  63. tail = b;
  64. }
  65. b.add(c);
  66. }
  67. RevObject next() {
  68. final Block b = head;
  69. if (b == null)
  70. return null;
  71. final RevObject c = b.pop();
  72. if (b.isEmpty()) {
  73. head = b.next;
  74. if (head == null)
  75. tail = null;
  76. free.freeBlock(b);
  77. }
  78. return c;
  79. }
  80. static final class BlockFreeList {
  81. private Block next;
  82. Block newBlock() {
  83. Block b = next;
  84. if (b == null)
  85. return new Block();
  86. next = b.next;
  87. b.clear();
  88. return b;
  89. }
  90. void freeBlock(final Block b) {
  91. b.next = next;
  92. next = b;
  93. }
  94. }
  95. static final class Block {
  96. private static final int BLOCK_SIZE = 256;
  97. /** Next block in our chain of blocks; null if we are the last. */
  98. Block next;
  99. /** Our table of queued objects. */
  100. final RevObject[] objects = new RevObject[BLOCK_SIZE];
  101. /** Next valid entry in {@link #objects}. */
  102. int headIndex;
  103. /** Next free entry in {@link #objects} for addition at. */
  104. int tailIndex;
  105. boolean isFull() {
  106. return tailIndex == BLOCK_SIZE;
  107. }
  108. boolean isEmpty() {
  109. return headIndex == tailIndex;
  110. }
  111. void add(final RevObject c) {
  112. objects[tailIndex++] = c;
  113. }
  114. RevObject pop() {
  115. return objects[headIndex++];
  116. }
  117. void clear() {
  118. next = null;
  119. headIndex = 0;
  120. tailIndex = 0;
  121. }
  122. }
  123. }