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.

AdvertiseRefsHookChain.java 3.5KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798
  1. /*
  2. * Copyright (C) 2012, Google Inc.
  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.transport;
  44. import java.util.List;
  45. /**
  46. * {@link AdvertiseRefsHook} that delegates to a list of other hooks.
  47. * <p>
  48. * Hooks are run in the order passed to the constructor. A hook may inspect or
  49. * modify the results of the previous hooks in the chain by calling
  50. * {@link UploadPack#getAdvertisedRefs()}, or
  51. * {@link BaseReceivePack#getAdvertisedRefs()} or
  52. * {@link BaseReceivePack#getAdvertisedObjects()}.
  53. */
  54. public class AdvertiseRefsHookChain implements AdvertiseRefsHook {
  55. private final AdvertiseRefsHook[] hooks;
  56. private final int count;
  57. /**
  58. * Create a new hook chaining the given hooks together.
  59. *
  60. * @param hooks
  61. * hooks to execute, in order.
  62. * @return a new hook chain of the given hooks.
  63. */
  64. public static AdvertiseRefsHook newChain(List<? extends AdvertiseRefsHook> hooks) {
  65. AdvertiseRefsHook[] newHooks = new AdvertiseRefsHook[hooks.size()];
  66. int i = 0;
  67. for (AdvertiseRefsHook hook : hooks)
  68. if (hook != AdvertiseRefsHook.DEFAULT)
  69. newHooks[i++] = hook;
  70. if (i == 0)
  71. return AdvertiseRefsHook.DEFAULT;
  72. else if (i == 1)
  73. return newHooks[0];
  74. else
  75. return new AdvertiseRefsHookChain(newHooks, i);
  76. }
  77. public void advertiseRefs(BaseReceivePack rp)
  78. throws ServiceMayNotContinueException {
  79. for (int i = 0; i < count; i++)
  80. hooks[i].advertiseRefs(rp);
  81. }
  82. public void advertiseRefs(UploadPack rp)
  83. throws ServiceMayNotContinueException {
  84. for (int i = 0; i < count; i++)
  85. hooks[i].advertiseRefs(rp);
  86. }
  87. private AdvertiseRefsHookChain(AdvertiseRefsHook[] hooks, int count) {
  88. this.hooks = hooks;
  89. this.count = count;
  90. }
  91. }